scientific article; zbMATH DE number 894702

zbMATH Open0851.05051MaRDI QIDQ4882976FDOQ4882976

Authors: Jozef Širáň, Norbert Sauer 

Publication date: 21 November 1996

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

Recommendations

• scientific article; zbMATH DE number 970799
• Polynomial bounds for chromatic number VI. Adding a four-vertex path
• A graph with cover degeneracy less than chromatic number
• The game chromatic number of trees and forests
• On a conjecture of Rödl and Voigt

zbMATH Keywords

chromatic numberforests

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (3)

• A graph with cover degeneracy less than chromatic number
• Simultaneous graph parameters: factor domination and factor total domination
• Chromatic uniqueness of the complements of certain forests

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