Hadwiger's conjecture for 3-arc graphs

zbMath1351.05091arXiv1310.4337MaRDI QIDQ727197

Guangjun Xu, David R. Wood, Sanming Zhou

Publication date: 6 December 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

graph minorgraph colouringHadwiger's conjecture3-arc graph

Mathematics Subject Classification ID

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

Related Items

Hadwiger's conjecture for squares of 2-trees ⋮ Weakening total coloring conjecture and Hadwiger's conjecture on total graphs ⋮ Three-arc graphs: characterization and domination

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A study of 3-arc graphs
• On the connectivity and restricted edge-connectivity of 3-arc graphs
• Hamiltonicity of 3-arc graphs
• Hadwiger's conjecture for powers of cycles and their complements
• Hadwiger's conjecture for proper circular arc graphs
• Diameter and connectivity of 3-arc graphs
• Hadwiger's conjecture for \(K_ 6\)-free graphs
• Imprimitive symmetric graphs, 3-arc graphs and 1-designs
• Finite symmetric graphs with two-arc transitive quotients
• Constructing a class of symmetric graphs
• Hadwiger's conjecture for line graphs
• Almost covers of 2-arc transitive graphs
• Hadwiger’s Conjecture
• Hadwiger's Conjecture for the Complements of Kneser Graphs
• On the characterization of path graphs
• CROSS RATIO GRAPHS
• Hadwiger's conjecture for quasi-line graphs
• Path graphs
• A class of finite symmetric graphs with 2-arc transitive quotients
• Finite symmetric graphs with two‐arc transitive quotients II
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
• The structure of k-chromatic graphs