Group chromatic number of graphs without \(K_5\)-minors

DOI10.1007/s003730200009zbMath0993.05073OpenAlexW1990070825MaRDI QIDQ1348659

Hong-Jian Lai, Xian-Kun Zhang

Publication date: 14 May 2002

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

Full work available at URL: https://doi.org/10.1007/s003730200009

zbMATH Keywords

planar graphgroup chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph minors (05C83)

Related Items (14)

Graph polynomials and group coloring of graphs ⋮ Disproof of the group coloring version of the Hadwiger conjecture ⋮ A small non-\(\mathbb Z_4\)-colorable planar graph ⋮ Group edge choosability of planar graphs without adjacent short cycles ⋮ Group connectivity and group colorings of graphs --- a survey ⋮ A note on group choosability of graphs with girth at least 4 ⋮ Group chromatic number of Halin graphs ⋮ On group choosability of graphs. II ⋮ On group chromatic number of graphs ⋮ HAJÓS-LIKE THEOREM FOR GROUP COLORING ⋮ Group colorings and DP-colorings of multigraphs using edge-disjoint decompositions ⋮ Alon-Tarsi number and modulo Alon-Tarsi number of signed graphs ⋮ Group connectivity and matchings ⋮ Group coloring is \(\Pi_2^{\text{P}}\)-complete

This page was built for publication: Group chromatic number of graphs without \(K_5\)-minors