scientific article; zbMATH DE number 653253

MaRDI QIDQ4309125zbMATH OpenFDO

Authors D. Hanson, Bjarne Toft

Publication date 18 May 1995

zbMATH Keywords

chromatic numbercolouringvertex arboricitycomplete graphcomplete bipartite graphcolour class\((m,n)\)-conjectureHajós conjecturevertex outer thicknessvertex thickness

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Recommendations

• On the conjecture of Hajos
• Subcontraction-equivalence and Hadwiger's conjecture
• scientific article; zbMATH DE number 919778
• On the Hajós number of graphs
• Some remarks on Hajós' conjecture
• scientific article; zbMATH DE number 3912417
• Improved Bounds for Topological Cliques in Graphs of Large Girth
• scientific article; zbMATH DE number 3285073
• Triangle-free graphs with large chromatic numbers
• On coloring graphs with locally small chromatic number

Cited in

(12)

• scientific article; zbMATH DE number 3957130 (Why is no real title available?)
• On vertex partitions and some minor-monotone graph parameters
• Study on the vertex chromatic conjecture of the graph
• scientific article; zbMATH DE number 5666686 (Why is no real title available?)
• scientific article; zbMATH DE number 4019101 (Why is no real title available?)
• The order conjecture fails in S
• The Gotsman-Linial Conjecture is False
• On the colorability of \(m\)-composed graphs
• scientific article; zbMATH DE number 3857143 (Why is no real title available?)
• On Vertex Partitions and the Colin de Verdière Parameter
• The Log-Approximate-Rank Conjecture Is False
• Hájek's theorem does not hold for \(n>1\)

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