On group choosability of total graphs

DOI10.1007/S00373-011-1114-2MaRDI QIDQ2376095zbMATH OpenOpenAlexFDO

Authors Hong-Jian Lai, Ghaffar Raeisi, G. R. Omidi

Publication date 26 June 2013

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1105.4940

zbMATH Keywords

group choosabilitylist total coloringtotal coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Abstract: In this paper, we study the group and list group colorings of total graphs and we give two group versions of the total and list total colorings conjectures. We establish the group version of the total coloring conjecture for the following classes of graphs: graphs with small maximum degree, two-degenerate graphs, planner graphs with maximum degree at least 11, planner graphs without certain small cycles, outerplanar and near-outerplanar graphs. In addition, the group version of the list total coloring conjecture is established for forests, outerplanar graphs and graphs with maximum degree at most two.

Recommendations

• List Total Colourings of Graphs
• Recent developments in total colouring
• On group choosability of graphs. I.
• On group choosability of graphs. II
• Edge and total choosability of near-outerplanar graphs

Cites work

• A generalization of Ramsey theory for linear forests
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
• Choosability and edge choosability of planar graphs without five cycles
• Edge and total choosability of near-outerplanar graphs
• Edge choosability of planar graphs without 5-cycles with a chord
• Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
• scientific article; zbMATH DE number 3735847 (Why is no real title available?)
• scientific article; zbMATH DE number 790475 (Why is no real title available?)
• scientific article; zbMATH DE number 2203240 (Why is no real title available?)
• List edge and list total colourings of multigraphs
• List Total Colourings of Graphs
• Mathematical Foundations of Computer Science 2004
• On group choosability of graphs. I.
• On Total Chromatic Number of a Graph
• Planar graphs without 5-cycles or without 6-cycles
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• Topology of series-parallel networks

Cited in

(4)

• Group colorings and DP-colorings of multigraphs using edge-disjoint decompositions
• On group choosability of graphs. I.
• scientific article; zbMATH DE number 870141 (Why is no real title available?)
• Group activity selection on graphs: parameterized analysis

This page was built for publication: On group choosability of total graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2376095)