List edge and list total coloring of planar graphs with maximum degree 8
From MaRDI portal
Publication:328709
DOI10.1007/S10878-015-9870-1zbMATH Open1348.05086OpenAlexW2028276400MaRDI QIDQ328709FDOQ328709
Weili Wu, Lidong Wu, Hongwei Gao, Bin Liu, Xin Zhang, Hui-Juan Wang
Publication date: 20 October 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-015-9870-1
Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15)
Cites Work
- 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
- A note on the minimum number of choosability of planar graphs
- Some upper bounds on the total and list chromatic numbers of multigraphs
- Minimum number of disjoint linear forests covering a planar graph
- Minimum total coloring of planar graph
- Title not available (Why is that?)
- 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
Cited In (8)
- Total coloring of planar graphs with maximum degree 8
- Total colorings-a survey
- Discount allocation for cost minimization in online social networks
- Total equitable list coloring
- Minimum total coloring of planar graphs with maximum degree 8
- List edge colorings of planar graphs without adjacent 7-cycles
- The list edge coloring and list total coloring of planar graphs with maximum degree at least 7
- List edge and list total coloring of planar graphs without intersecting 8-cycles
This page was built for publication: List edge and list total coloring of planar graphs with maximum degree 8
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q328709)
