On group choosability of total graphs

DOI10.1007/S00373-011-1114-2zbMATH Open1267.05119arXiv1105.4940OpenAlexW2149076994MaRDI QIDQ2376095FDOQ2376095

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

Publication date: 26 June 2013

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

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.

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

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

zbMATH Keywords

total coloringlist total coloringgroup choosability

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• On group choosability of graphs. I.
• Group colorings and DP-colorings of multigraphs using edge-disjoint decompositions
• Group activity selection on graphs: parameterized analysis
• Title not available (Why is that?)

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)