On 4-colorable robust critical graphs

DOI10.47443/DML.2021.S107MaRDI QIDQ5862698zbMATH OpenOpenAlexFDO

Authors Robert Brigham, Richard P. Vitray, Mark Anderson, Ronald D. Dutton, Jay Yellen

Publication date 9 March 2022

Published in Discrete Mathematics Letters (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.47443/dml.2021.s107

zbMATH Keywords

\(\chi\)-robust-criticalchromatic numberrobust coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Note on robust critical graphs with large odd girth
• scientific article; zbMATH DE number 2077673
• Every 4-colorable graph with maximum degree 4 has an equitable 4-coloring
• A critically chromatic graph
• A note on local coloring of graphs

Cites work

• Eternal chromatic number
• scientific article; zbMATH DE number 3465328 (Why is no real title available?)

Cited in

(3)

• On 4-chromatic Schrijver graphs: their structure, non-3-colorability, and critical edges
• The robust chromatic number of graphs
• Note on robust coloring of planar graphs

This page was built for publication: On \(4\)-colorable robust critical graphs

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