All subgraphs of a wheel are 5-coupled-choosable

DOI10.1007/978-3-030-79987-8_6OpenAlexW3185054184MaRDI QIDQ2115842

Sam Barr, Therese C. 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

• On the complexity of some colorful problems parameterized by treewidth
• \(\Delta \)-list vertex coloring in linear time
• Generalized coloring for tree-like graphs
• Drawing planar 3-trees with given face areas
• Colorings of plane graphs: a survey
• Ein Sechsfarbenproblem auf der Kugel
• Graph Theory
• On list-coloring extendable outerplanar graphs
• Full 4-colorings of 4-regular maps
• Zur Struktur 1‐planarer Graphen
• The Recognition of Series Parallel Digraphs
• Coupled choosability of plane graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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