On the total choosability of planar graphs and of sparse graphs

DOI10.1016/J.IPL.2010.07.007MaRDI QIDQ407575zbMATH OpenOpenAlexFDO

Authors Gerard Jennhwa Chang, Nicolas Roussel, Jianfeng Hou

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

zbMATH Keywords

planar graphstotal coloringcombinatorial problemsmaximum average degreecycle-freemadtotal choosability

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Total choosablility of planar graphs with maximum degree 5
• Total choosability of planar graphs with maximum degree 4
• Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$‐choosable
• Total colorings of planar graphs with large maximum degree
• The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven

Cites work

• (d,1)-total labeling of graphs with a given maximum average degree
• List Total Colourings of Graphs
• List edge and list total colorings of planar graphs without 4-cycles
• List edge and list total colourings of multigraphs
• On total 9-coloring planar graphs of maximum degree seven
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• The total chromatic number of any multigraph with maximum degree five is at most seven
• The total coloring of a multigraph with maximal degree 4
• Total chromatic number of planar graphs with maximum degree ten
• Total colorings and list total colorings of planar graphs without intersecting 4-cycles
• Total colorings of planar graphs with large maximum degree
• Total colorings of planar graphs without small cycles
• Total colourings of graphs
• Total colourings of planar graphs with large girth

Cited in

(15)

• List edge and list total coloring of planar graphs without intersecting 8-cycles
• 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
• Total choosablility of planar graphs with maximum degree 5
• A note on list edge and list total coloring of planar graphs without adjacent short cycles
• List edge colorings of planar graphs without adjacent 7-cycles
• scientific article; zbMATH DE number 7055496 (Why is no real title available?)
• Choosability of planar graphs
• Two results on \(k\)-\((2,1)\)-total choosability of planar graphs
• A result on \(K\)-\((2,1)\)-total 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

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)