Decompositions of graphs of nonnegative characteristic with some forbidden subgraphs

DOI10.1016/j.amc.2023.128126arXiv2204.08161OpenAlexW4378699810MaRDI QIDQ6108003

Xiangwen Li, Fangyu Tian, Lin Niu

Publication date: 29 June 2023

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

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

zbMATH Keywords

decompositioncoloringlist coloringDP-coloringAlon-Tarsi number

Mathematics Subject Classification ID

Graph theory (05Cxx) Algebraic combinatorics (05Exx) Enumerative combinatorics (05Axx)

Related Items

Decomposition of toroidal graphs without some subgraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• Proof of the list edge coloring conjecture for complete graphs of prime degree
• A note on list improper coloring of plane graphs
• Covering planar graphs with forests, one having bounded maximum degree
• Colorings and orientations of graphs
• The game coloring number of pseudo partial \(k\)-trees
• The Alon-Tarsi number of planar graphs without cycles of lengths 4 and \(l\)
• Improper choosability of graphs of nonnegative characteristic
• Decomposition of planar graphs with forbidden configurations
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• ON (3, 1)*-CHOOSABILITY OF TOROIDAL GRAPHS
• Game chromatic number of outerplanar graphs
• A note on list improper coloring planar graphs
• Decomposing planar graphs into graphs with degree restrictions