The robust chromatic number of graphs

DOI10.1007/s00373-024-02817-1zbMath1546.0506MaRDI QIDQ6598012

Máté Vizer, Zsolt Tuza, Balázs Patkós, Gábor Bacsó

Publication date: 4 September 2024

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

chromatic numbergraph parameters1-removed graph

Mathematics Subject Classification ID

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

Related Items (1)

Note on robust coloring of planar graphs

Cites Work

• Unnamed Item
• The most vital nodes with respect to independent set and vertex cover
• Acyclic edge coloring of planar graphs with \(\varDelta\) colors
• Orientations of graphs with prescribed weighted out-degrees
• Treewidth. Computations and approximations
• A note on not-4-list colorable planar graphs
• The point-arboricity of a graph
• On the degrees of the vertices of a directed graph
• Normal hypergraphs and the perfect graph conjecture
• On a property of the class of n-colorable graphs
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Perfect zero–one matrices
• COVERING AND PACKING IN GRAPHS, I.
• Extremal graph theoretic questions for q-ary vectors

This page was built for publication: The robust chromatic number of graphs