Search results
Results from the WOW.Com Content Network
Matching (graph theory) MaxDDBS; Maximal independent set; Maximum agreement subtree problem; Maximum common edge subgraph; Maximum common induced subgraph; Maximum cut; Maximum flow problem; Maximum weight matching; Metric k-center; Minimum k-cut; Mixed Chinese postman problem; Multi-trials technique
When the degree is less than or equal to 2 or the diameter is less than or equal to 1, the problem becomes trivial, solved by the cycle graph and complete graph respectively. In graph theory, the degree diameter problem is the problem of finding the largest possible graph G (in terms of the size of its vertex set V) of diameter k such that the ...
The "pearls" of the title include theorems, proofs, problems, and examples in graph theory.The book has ten chapters; after an introductory chapter on basic definitions, the remaining chapters material on graph coloring; Hamiltonian cycles and Euler tours; extremal graph theory; subgraph counting problems including connections to permutations, derangements, and Cayley's formula; graph ...
In graph theory, the metric dimension of a graph G is the minimum cardinality of a subset S of vertices such that all other vertices are uniquely determined by their distances to the vertices in S. Finding the metric dimension of a graph is an NP-hard problem; the decision version, determining whether the metric dimension is less than a given ...
Download QR code; Print/export Download as PDF; Printable version; In other projects ... Pages in category "Unsolved problems in graph theory" The following 32 pages ...
The degree diameter problem seeks tight relations between the diameter, number of vertices, and degree of a graph. One way of formulating it is to ask for the largest graph with given bounds on its degree and diameter. For any fixed degree, this maximum size is exponential in the diameter, with the base of the exponent depending on the degree. [1]
The graph sandwich problem is NP-complete when Π is the property of being a chordal graph, comparability graph, permutation graph, chordal bipartite graph, or chain graph. [2] [4] It can be solved in polynomial time for split graphs, [2] [5] threshold graphs, [2] [5] and graphs in which every five vertices contain at most one four-vertex ...
Often, the problem is to decompose a graph into subgraphs isomorphic to a fixed graph; for instance, decomposing a complete graph into Hamiltonian cycles. Other problems specify a family of graphs into which a given graph should be decomposed, for instance, a family of cycles, or decomposing a complete graph K n into n − 1 specified trees ...