A refinement of choosability of graphs

DOI10.1016/j.jctb.2019.07.006zbMath1430.05046arXiv1811.08587OpenAlexW2964620984MaRDI QIDQ2284741

Xuding Zhu

Publication date: 15 January 2020

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

planar graphssigned graphgeneralized signed graph\(\lambda\)-assignment\(\lambda\)-choosability

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Signed and weighted graphs (05C22)

Related Items (14)

Generalized signed graphs of large girth and large chromatic number ⋮ Flexible list colorings in graphs with special degeneracy conditions ⋮ Chromatic λ‐choosable and λ‐paintable graphs ⋮ Signed colouring and list colouring of k‐chromatic graphs ⋮ Girth and λ $\lambda $‐choosability of graphs ⋮ List 4-colouring of planar graphs ⋮ Refined List Version of Hadwiger’s Conjecture ⋮ The Alon-Tarsi number of a planar graph minus a matching ⋮ On the 4-color theorem for signed graphs ⋮ Concepts of signed graph coloring ⋮ Colouring of \(S\)-labelled planar graphs ⋮ Flexible List Colorings in Graphs with Special Degeneracy Conditions ⋮ Circular chromatic number of signed graphs ⋮ Complex and homomorphic chromatic number of signed planar simple graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Steinberg's conjecture is false
• Multiple list colouring of planar graphs
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• List colourings of planar graphs
• Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable
• A note on the not 3-choosability of some families of planar graphs
• The chromatic number of a signed graph
• Signed graph coloring
• Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
• Every planar graph is 5-choosable
• List edge and list total colourings of multigraphs
• A note on not-4-list colorable planar graphs
• Colouring of generalized signed triangle-free planar graphs
• Planar graphs without cycles of length from 4 to 7 are 3-colorable
• Coloring face-hypergraphs of graphs on surfaces
• A not 3-choosable planar graph without 3-cycles
• On the 4-color theorem for signed graphs
• DP-colorings of graphs with high chromatic number
• On \(t\)-common list-colorings
• Note on a paper of B. Grünbaum on acyclic colorings
• The chromatic spectrum of signed graphs

This page was built for publication: A refinement of choosability of graphs