scientific article; zbMATH DE number 3902681

MaRDI QIDQ3680855zbMATH OpenFDO

Authors Alan C. Tucker

Publication date 1984

zbMATH Keywords

maximal cliquesmaximal stable setsSPGCK(4)-free planar graphpseudo-p-critical graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Recommendations

• Coloring perfect \((K_ 4\)-e)-free graphs
• On the strong perfect graph conjecture
• On essential components and critical sets of a graph
• On minimal imperfect graphs without induced P₅
• scientific article; zbMATH DE number 846970

Cited in

(17)

• On planar perfectly contractile graphs
• Three-colourable perfect graphs without even pairs
• On Tucker's proof of the strong perfect graph conjecture for \((K_4-e)\)-free graphs
• On minimal imperfect graphs without induced P₅
• Strong T-Perfection of Bad-K₄ -Free Graphs
• On edge perfectness and classes of bipartite graphs
• On a connection between facility location and perfect graphs
• Classes of perfect graphs
• On a conjecture about uniquely colorable perfect graphs
• A vertex critical graph without critical edges
• Perfect graphs with no \(P_ 5\) and no \(K_ 5\)
• scientific article; zbMATH DE number 5038489 (Why is no real title available?)
• On transversals in minimal imperfect graphs
• On a class of square-free graphs
• scientific article; zbMATH DE number 3902680 (Why is no real title available?)
• The optimal cost chromatic partition problem for trees and interval graphs
• About skew partitions in minimal imperfect graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3680855)