Weak degeneracy of graphs

DOI10.1002/jgt.22938zbMath1522.05093arXiv2111.05908OpenAlexW4323666704MaRDI QIDQ6047953

Eugene Lee, Anton Bernshteyn

Publication date: 10 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2111.05908

zbMATH Keywords

graph coloringgreedy algorithmsmaximum degreeweak degeneracyDP-coloringgraph degeneracy

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Vertex degrees (05C07)

Related Items (3)

Weak degeneracy of planar graphs and locally planar graphs ⋮ The relation between the harmonic index and some coloring parameters ⋮ Weak degeneracy of planar graphs without 4- and 6-cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• List colourings of planar graphs
• Explicit construction of regular graphs without small cycles
• Explicit constructions of graphs without short cycles and low density codes
• On regular bipartite-preserving supergraphs
• Every planar graph is 5-choosable
• On-line DP-coloring of graphs
• On DP-coloring of graphs and multigraphs
• The asymptotic behavior of the correspondence chromatic number
• Graph Theory
• On chromatic number of graphs and set-systems
• Colouring graphs with forbidden bipartite subgraphs
• Graph colouring and the probabilistic method

This page was built for publication: Weak degeneracy of graphs