On the total choosability of planar graphs and of sparse graphs
DOI10.1016/J.IPL.2010.07.007zbMATH Open1234.05081OpenAlexW1978952272MaRDI QIDQ407575FDOQ407575
Nicolas Roussel, Jianfeng Hou, Gerard Jennhwa Chang
Publication date: 27 March 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://ntur.lib.ntu.edu.tw/bitstream/246246/238948/-1/102.pdf
planar graphstotal coloringcombinatorial problemsmaximum average degreecycle-freemadtotal choosability
Planar graphs; geometric and topological aspects of graph theory (05C10) 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
- List edge and list total colorings of planar graphs without 4-cycles
- The total chromatic number of any multigraph with maximum degree five is at most seven
- Total colourings of planar graphs with large girth
- Total colourings of graphs
- Total chromatic number of planar graphs with maximum degree ten
- On total 9-coloring planar graphs of maximum degree seven
- Total colorings of planar graphs with large maximum degree
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
- The total coloring of a multigraph with maximal degree 4
- (d,1)-total labeling of graphs with a given maximum average degree
- List Total Colourings of Graphs
- Total colorings of planar graphs without small cycles
Cited In (12)
- Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles
- Path choosability of planar graphs
- (\( \Delta + 1\))-total choosability of planar graphs with no cycles of length from 4 to \(k\) and without close triangles
- Total choosability of planar graphs with maximum degree 4
- A note on list edge and list total coloring of planar graphs without adjacent short cycles
- Title not available (Why is that?)
- List edge colorings of planar graphs without adjacent 7-cycles
- Choosability of planar graphs
- A structural theorem for planar graphs with some applications
- List-edge-coloring of planar graphs without 6-cycles with three chords
- Acyclic 3-choosability of sparse graphs with girth at least 7
- List edge and list total coloring of planar graphs without intersecting 8-cycles
This page was built for publication: On the total choosability of planar graphs and of sparse graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q407575)
