Coloring Powers and Girth

DOI10.1137/15M1035422zbMath1347.05070arXiv1511.08826OpenAlexW2269072799MaRDI QIDQ2827489

Ross J. Kang, François Pirot

Publication date: 20 October 2016

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

graph coloringgirthgraph powers

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items

Distance colouring without one cycle length, Distance Colouring Without One Cycle Length, Optimization of eigenvalue bounds for the independence and chromatic number of graph powers, $t$-Strong Cliques and the Degree-Diameter Problem

Cites Work

• Unnamed Item
• Unnamed Item
• Coloring graphs with sparse neighborhoods
• The nonexistence of certain generalized polygons
• Moore graphs and beyond: a survey of the degree/diameter problem
• On maximal paths and circuits of graphs
• The Chromatic Number of Graph Powers
• The Distance-t Chromatic Index of Graphs
• ON THE DIFFERENCE BETWEEN CONSECUTIVE PRIMES
• Graph colouring and the probabilistic method