Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: Perfect graph theorem (view), Strong perfect graph theorem (view), Trivially perfect graph (view), Line perfect graph (view)

searching for Perfect graph 7 found (74 total)

alternate case: perfect graph

Dominating set (4,082 words) [view diff] exact match in snippet view article find links to article

= i(G) if G is a claw-free graph. A graph G is called a domination-perfect graph if γ(H) = i(H) in every induced subgraph H of G. Since an induced subgraph

K. R. Parthasarathy (graph theorist) (157 words) [view diff] exact match in snippet view article

(with his student G. Ravindra) proving the special case of the strong perfect graph conjecture for claw-free graphs. Parthasarathy guided and refereed Ph

List of Georgia Institute of Technology faculty (904 words) [view diff] exact match in snippet view article find links to article

proved the Erdős–Graham conjecture D. M. Smith Mathematics Robin Thomas Mathematics graph theory; proved the strong perfect graph and other conjectures

Clique-width (2,057 words) [view diff] exact match in snippet view article find links to article

Golumbic, Martin Charles; Rotics, Udi (2000), "On the clique-width of some perfect graph classes", International Journal of Foundations of Computer Science,

Balanced hypergraph (1,293 words) [view diff] exact match in snippet view article find links to article

S2CID 84670737. Lovász, L. (1972-06-01). "Normal hypergraphs and the perfect graph conjecture". Discrete Mathematics. 2 (3): 253–267. doi:10.1016/0012-365X(72)90006-4

List of unsolved problems in mathematics (20,026 words) [view diff] exact match in snippet view article find links to article

Robertson–Seymour theorem (Neil Robertson, Paul Seymour, 2004) Strong perfect graph conjecture (Maria Chudnovsky, Neil Robertson, Paul Seymour and Robin

François Jaeger (mathematician) (659 words) [view diff] exact match in snippet view article

and nowhere-zero flows, such as the Four color theorem, the Strong perfect graph theorem, and Tutte's 3-flow, 4-flow, and 5-flow conjectures. Gradually