A note on the minimum number of choosability of planar graphs
From MaRDI portal
Publication:266020
DOI10.1007/s10878-014-9805-2zbMath1344.90065OpenAlexW2021480812MaRDI QIDQ266020
Weili Wu, Xin Zhang, Bin Liu, Lidong Wu, Hui-Juan Wang
Publication date: 13 April 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-014-9805-2
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15)
Related Items
List edge and list total coloring of planar graphs without intersecting 8-cycles ⋮ List edge and list total coloring of planar graphs with maximum degree 8 ⋮ An efficient case for computing minimum linear arboricity with small maximum degree ⋮ Optimal channel assignment with list-edge coloring ⋮ The list edge coloring and list total coloring of planar graphs with maximum degree at least 7 ⋮ Unnamed Item ⋮ Minimum choosability of planar graphs ⋮ List edge colorings of planar graphs without adjacent 7-cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Minimum number of disjoint linear forests covering a planar graph
- Minimum total coloring of planar graph
- Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles
- Acyclically 3-colorable planar graphs
- List edge and list total colorings of planar graphs without 4-cycles
- Total colorings and list total colorings of planar graphs without intersecting 4-cycles
- List edge and list total colourings of multigraphs
- Coloring of double disk graphs
- Distributed long-lived list colouring: How to dynamically allocate frequencies in cellular networks
- The \(L(2,1)\)-labelling problem for cubic Cayley graphs on dihedral groups
- Enumerating the edge-colourings and total colourings of a regular graph
- Some upper bounds on the total and list chromatic numbers of multigraphs
This page was built for publication: A note on the minimum number of choosability of planar graphs
