The robust chromatic number of graphs

DOI10.1007/S00373-024-02817-1MaRDI QIDQ6598012zbMATH OpenFDO

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

Publication date 4 September 2024

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

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

chromatic numbergraph parameters1-removed graph

Mathematics Subject Classification ID

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

Recommendations

• Note on robust coloring of planar graphs
• On the edge chromatic vertex stability number of graphs
• On \(4\)-colorable robust critical graphs
• On the vertex stability numbers of graphs
• On the Total Chromatic Edge Stability Number and the Total Chromatic Subdivision Number of Graphs

Cites work

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

Cited in

(1)

• Note on robust coloring of planar graphs

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

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