Note on robust coloring of planar graphs

DOI10.7494/OPMATH.2025.45.1.103MaRDI QIDQ6667293FDOQ6667293

Authors: František Kardoš, Borut Lužar, Roman Soták 

Publication date: 20 January 2025

Published in: Opuscula Mathematica (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 1347005
• On \(4\)-colorable robust critical graphs
• Planar graphs have two-coloring number at most 8
• Complete colorings of planar graphs
• Star chromatic numbers of a family of planar graphs

zbMATH Keywords

planar graphTutte graphrobust coloringrobust chromatic number

Mathematics Subject Classification ID

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

Cites Work

• Graphs on surfaces
• Five-coloring graphs on the torus
• On Hamiltonian Circuits
• The number of cycles in 2-factors of cubic graphs
• 2-isomorphic graphs.
• A note on not-4-list colorable planar graphs
• The theory of regular graphs
• Extremal graph theoretic questions for q-ary vectors
• The robust chromatic number of graphs

Cited In (1)

• The robust chromatic number of graphs

This page was built for publication: Note on robust coloring of planar graphs

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