Some bounds on the generalised total chromatic number of degenerate graphs

DOI10.1016/J.IPL.2017.02.008zbMath1422.05041OpenAlexW2594757543MaRDI QIDQ1675922

Izak Broere, Gabriel Semanisin

Publication date: 3 November 2017

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2263/59566

zbMATH Keywords

combinatorial problemsgraph property\(k\)-degenerate graphtotal colouring number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Minimal reducible bounds for induced-hereditary properties
• Total colorings of degenerate graphs
• Generalized total colorings of graphs
• Maximal Flow Through a Network
• A survey of hereditary properties of graphs
• k-Degenerate Graphs
• Minimal reducible bounds for the class of \(k\)-degenerate graphs

This page was built for publication: Some bounds on the generalised total chromatic number of degenerate graphs