The Chromatic Number of Graph Powers
From MaRDI portal
Publication:4330739
DOI10.1017/S0963548301004965zbMath0991.05042OpenAlexW2018074536MaRDI QIDQ4330739
Publication date: 25 August 2002
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548301004965
Related Items (22)
Sharp upper bounds on the \(k\)-independence number in graphs with given minimum and maximum degree ⋮ Exact square coloring of subcubic planar graphs ⋮ A new approach to the chromatic number of the square of Kneser graph \(K(2k+1,k)\) ⋮ Distance colouring without one cycle length ⋮ Coloring squares of planar graphs with girth six ⋮ A new class of polynomials from the spectrum of a graph, and its application to bound the \(k\)-independence number ⋮ Complexity of finding graph roots with girth conditions ⋮ Distance labellings of Cayley graphs of semigroups ⋮ Clustering powers of sparse graphs ⋮ Frugal, acyclic and star colourings of graphs ⋮ Randomly colouring graphs (a combinatorial view) ⋮ On the two largest distance eigenvalues of graph powers ⋮ On colorings of graph fractional powers ⋮ Injective colorings of sparse graphs ⋮ A note on the chromatic number of the square of Kneser graph \(K(2 k + 1, k)\) ⋮ Distance Colouring Without One Cycle Length ⋮ Acyclic and \(k\)-distance coloring of the grid ⋮ Coloring Powers and Girth ⋮ Optimization of eigenvalue bounds for the independence and chromatic number of graph powers ⋮ On the \(k\)-independence number of graphs ⋮ A characterization of graphs with regular distance-2 graphs ⋮ Linear-time algorithms for tree root problems
This page was built for publication: The Chromatic Number of Graph Powers
