Faster access than browser!
38 relations: Approximation algorithm, Bulletin of the American Mathematical Society, Chordal graph, Clique (graph theory), Connected sum, Connectivity (graph theory), Discrete Mathematics (journal), Disjoint union of graphs, Four color theorem, Genus (mathematics), Graph minor, Graph structure theorem, Graph theory, Graphic matroid, Hadwiger conjecture (graph theory), Induced subgraph, Journal of Combinatorial Theory, Journal of Computer and System Sciences, Journal of Graph Theory, Journal of the ACM, K-vertex-connected graph, Mathematische Annalen, Matrix (mathematics), Matroid, NP-completeness, Pathwidth, Planar graph, Positive-definite matrix, Regular matroid, Series-parallel graph, SPQR tree, Strangulated graph, Symposium on Foundations of Computer Science, Topology, Tree (graph theory), Treewidth, Unimodular matrix, Wagner graph.
Approximation algorithm
In computer science and operations research, approximation algorithms are efficient algorithms that find approximate solutions to NP-hard optimization problems with provable guarantees on the distance of the returned solution to the optimal one.
New!!: Clique-sum and Approximation algorithm · See more »
Bulletin of the American Mathematical Society
The Bulletin of the American Mathematical Society is a quarterly mathematical journal published by the American Mathematical Society.
New!!: Clique-sum and Bulletin of the American Mathematical Society · See more »
Chordal graph
In the mathematical area of graph theory, a chordal graph is one in which all cycles of four or more vertices have a chord, which is an edge that is not part of the cycle but connects two vertices of the cycle.
New!!: Clique-sum and Chordal graph · See more »
Clique (graph theory)
In the mathematical area of graph theory, a clique is a subset of vertices of an undirected graph such that every two distinct vertices in the clique are adjacent; that is, its induced subgraph is complete.
New!!: Clique-sum and Clique (graph theory) · See more »
Connected sum
In mathematics, specifically in topology, the operation of connected sum is a geometric modification on manifolds.
New!!: Clique-sum and Connected sum · See more »
Connectivity (graph theory)
In mathematics and computer science, connectivity is one of the basic concepts of graph theory: it asks for the minimum number of elements (nodes or edges) that need to be removed to disconnect the remaining nodes from each other.
New!!: Clique-sum and Connectivity (graph theory) · See more »
Discrete Mathematics (journal)
Discrete Mathematics is a biweekly peer-reviewed scientific journal in the broad area of discrete mathematics, combinatorics, graph theory, and their applications.
New!!: Clique-sum and Discrete Mathematics (journal) · See more »
Disjoint union of graphs
In graph theory, a branch of mathematics, the disjoint union of graphs is an operation that combines two or more graphs to form a larger graph.
New!!: Clique-sum and Disjoint union of graphs · See more »
Four color theorem
In mathematics, the four color theorem, or the four color map theorem, states that, given any separation of a plane into contiguous regions, producing a figure called a map, no more than four colors are required to color the regions of the map so that no two adjacent regions have the same color.
New!!: Clique-sum and Four color theorem · See more »
Genus (mathematics)
In mathematics, genus (plural genera) has a few different, but closely related, meanings.
New!!: Clique-sum and Genus (mathematics) · See more »
Graph minor
In graph theory, an undirected graph H is called a minor of the graph G if H can be formed from G by deleting edges and vertices and by contracting edges.
New!!: Clique-sum and Graph minor · See more »
Graph structure theorem
In mathematics, the graph structure theorem is a major result in the area of graph theory.
New!!: Clique-sum and Graph structure theorem · See more »
Graph theory
In mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects.
New!!: Clique-sum and Graph theory · See more »
Graphic matroid
In the mathematical theory of matroids, a graphic matroid (also called a cycle matroid or polygon matroid) is a matroid whose independent sets are the forests in a given undirected graph.
New!!: Clique-sum and Graphic matroid · See more »
Hadwiger conjecture (graph theory)
In graph theory, the Hadwiger conjecture (or Hadwiger's conjecture) states that, if all proper colorings of an undirected graph G use k or more colors, then one can find k disjoint connected subgraphs of G such that each subgraph is connected by an edge to each other subgraph.
New!!: Clique-sum and Hadwiger conjecture (graph theory) · See more »
Induced subgraph
In graph theory, an induced subgraph of a graph is another graph, formed from a subset of the vertices of the graph and all of the edges connecting pairs of vertices in that subset.
New!!: Clique-sum and Induced subgraph · See more »
Journal of Combinatorial Theory
The Journal of Combinatorial Theory, Series A and Series B, are mathematical journals specializing in combinatorics and related areas.
New!!: Clique-sum and Journal of Combinatorial Theory · See more »
Journal of Computer and System Sciences
The Journal of Computer and System Sciences (JCSS) is a peer-reviewed scientific journal in the field of computer science.
New!!: Clique-sum and Journal of Computer and System Sciences · See more »
Journal of Graph Theory
The Journal of Graph Theory is a peer-reviewed mathematics journal specializing in graph theory and related areas, such as structural results about graphs, graph algorithms with theoretical emphasis, and discrete optimization on graphs.
New!!: Clique-sum and Journal of Graph Theory · See more »
Journal of the ACM
The Journal of the ACM is a peer-reviewed scientific journal covering computer science in general, especially theoretical aspects.
New!!: Clique-sum and Journal of the ACM · See more »
K-vertex-connected graph
In graph theory, a connected graph G is said to be k-vertex-connected (or k-connected) if it has more than k vertices and remains connected whenever fewer than k vertices are removed.
New!!: Clique-sum and K-vertex-connected graph · See more »
Mathematische Annalen
Mathematische Annalen (abbreviated as Math. Ann. or, formerly, Math. Annal.) is a German mathematical research journal founded in 1868 by Alfred Clebsch and Carl Neumann.
New!!: Clique-sum and Mathematische Annalen · See more »
Matrix (mathematics)
In mathematics, a matrix (plural: matrices) is a rectangular array of numbers, symbols, or expressions, arranged in rows and columns.
New!!: Clique-sum and Matrix (mathematics) · See more »
Matroid
In combinatorics, a branch of mathematics, a matroid is a structure that abstracts and generalizes the notion of linear independence in vector spaces.
New!!: Clique-sum and Matroid · See more »
NP-completeness
In computational complexity theory, an NP-complete decision problem is one belonging to both the NP and the NP-hard complexity classes.
New!!: Clique-sum and NP-completeness · See more »
Pathwidth
In graph theory, a path decomposition of a graph G is, informally, a representation of G as a "thickened" path graph, and the pathwidth of G is a number that measures how much the path was thickened to form G.
New!!: Clique-sum and Pathwidth · See more »
Planar graph
In graph theory, a planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect only at their endpoints.
New!!: Clique-sum and Planar graph · See more »
Positive-definite matrix
In linear algebra, a symmetric real matrix M is said to be positive definite if the scalar z^Mz is strictly positive for every non-zero column vector z of n real numbers.
New!!: Clique-sum and Positive-definite matrix · See more »
Regular matroid
In mathematics, a regular matroid is a matroid that can be represented over all fields.
New!!: Clique-sum and Regular matroid · See more »
Series-parallel graph
In graph theory, series-parallel graphs are graphs with two distinguished vertices called terminals, formed recursively by two simple composition operations.
New!!: Clique-sum and Series-parallel graph · See more »
SPQR tree
In graph theory, a branch of mathematics, the triconnected components of a biconnected graph are a system of smaller graphs that describe all of the 2-vertex cuts in the graph.
New!!: Clique-sum and SPQR tree · See more »
Strangulated graph
In graph theoretic mathematics, a strangulated graph is a graph in which deleting the edges of any induced cycle of length greater than three would disconnect the remaining graph.
New!!: Clique-sum and Strangulated graph · See more »
Symposium on Foundations of Computer Science
The IEEE Annual Symposium on Foundations of Computer Science (FOCS) is an academic conference in the field of theoretical computer science.
New!!: Clique-sum and Symposium on Foundations of Computer Science · See more »
Topology
In mathematics, topology (from the Greek τόπος, place, and λόγος, study) is concerned with the properties of space that are preserved under continuous deformations, such as stretching, crumpling and bending, but not tearing or gluing.
New!!: Clique-sum and Topology · See more »
Tree (graph theory)
In mathematics, and more specifically in graph theory, a tree is an undirected graph in which any two vertices are connected by exactly one path.
New!!: Clique-sum and Tree (graph theory) · See more »
Treewidth
In graph theory, the treewidth of an undirected graph is a number associated with the graph.
New!!: Clique-sum and Treewidth · See more »
Unimodular matrix
In mathematics, a unimodular matrix M is a square integer matrix having determinant +1 or −1.
New!!: Clique-sum and Unimodular matrix · See more »
Wagner graph
In the mathematical field of graph theory, the Wagner graph is a 3-regular graph with 8 vertices and 12 edges.
New!!: Clique-sum and Wagner graph · See more »
Redirects here:
Seymour's decomposition theorem.
References
[1] https://en.wikipedia.org/wiki/Clique-sum
