scientific article; zbMATH DE number 4002120

zbMATH Open0618.05024MaRDI QIDQ3754634FDOQ3754634

Authors: D. Hanson, Gordon C. Robinson, Bjarne Toft 

Publication date: 1986

Title of this publication is not available (Why is that?)

Recommendations

• Haj�s constructions of critical graphs
• Hajós theorem for colorings of edge-weighted graphs
• The graph constructions ofHaj�s and Ore
• scientific article; zbMATH DE number 3882454
• A Hajós-like theorem for list coloring

zbMATH Keywords

k-critical graphHajós construction

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (13)

• Hajós and Ore constructions for digraphs
• Hajós' theorem for list coloring
• Grassmann homomorphism and Hajós-type theorems
• Frozen development in graph coloring
• Constructive generation of very hard 3-colorability instances
• Hajós theorem for colorings of edge-weighted graphs
• On constructive methods in the theory of colour-critical graphs
• Hajós-Type Constructions and Neighborhood Complexes
• Hajós' theorem for list colorings of hypergraphs
• On a coloring conjecture of Hajós
• The Complexity of the Hajós Calculus
• Revisiting a theorem by Folkman on graph colouring
• Title not available (Why is that?)

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 Q3754634)