All subgraphs of a wheel are 5-coupled-choosable

DOI10.1007/978-3-030-79987-8_6MaRDI QIDQ2115842zbMATH OpenOpenAlexFDO

Authors Sam Barr, Therese Biedl

Publication date 22 March 2022

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Cites work

• scientific article; zbMATH DE number 3865308 (Why is no real title available?)
• scientific article; zbMATH DE number 3900784 (Why is no real title available?)
• scientific article; zbMATH DE number 4047751 (Why is no real title available?)
• scientific article; zbMATH DE number 3735847 (Why is no real title available?)
• Colorings of plane graphs: a survey
• Coupled choosability of near-outerplane graphs.
• Coupled choosability of plane graphs
• Drawing planar 3-trees with given face areas
• Ein Sechsfarbenproblem auf der Kugel
• Full 4-colorings of 4-regular maps
• Generalized coloring for tree-like graphs
• Graph theory
• List coloring Halin graphs.
• On list-coloring extendable outerplanar graphs
• On the complexity of some colorful problems parameterized by treewidth
• The Recognition of Series Parallel Digraphs
• Treewidth-two graphs as a free algebra
• Zur Struktur 1‐planarer Graphen
• -list vertex coloring in linear time

Cited in

(1)

• All Subgraphs of a Wheel are 5-Coupled-Choosable

This page was built for publication: All subgraphs of a wheel are 5-coupled-choosable

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