A note on coloring vertex-transitive graphs
From MaRDI portal
Publication:2341047
zbMath1310.05087arXiv1404.6550MaRDI QIDQ2341047
Daniel W. Cranston, Landon Rabern
Publication date: 22 April 2015
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1404.6550
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (6)
Multiple list colouring of planar graphs ⋮ Two more characterizations of König-Egerváry graphs ⋮ Graphs with $\chi=\Delta$ Have Big Cliques ⋮ Strong cliques in vertex‐transitive graphs ⋮ Vertex-transitive CIS graphs ⋮ A distributed computing perspective of unconditionally secure information transmission in Russian cards problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Independence, clique size and maximum degree
- On an upper bound of the graph's chromatic number, depending on the graph's degree and density
- Another bound on the chromatic number of a graph
- Hajos' graph-coloring conjecture: Variations and counterexamples
- A strengthening of Brooks' theorem
- Independent systems of representatives in weighted graphs
- A Note on Vertex List Colouring
- Graphs with $\chi=\Delta$ Have Big Cliques
- On hitting all maximum cliques with an independent set
- A Short Proof That χ Can be Bounded ε Away from Δ + 1 toward ω
- An improved bound for the strong chromatic number
- On the Strong Chromatic Number
- Transversals of Vertex Partitions in Graphs
- A Note on Hitting Maximum and Maximal Cliques With a Stable Set
- A Theorem on k-Saturated Graphs
- Graph colouring and the probabilistic method
This page was built for publication: A note on coloring vertex-transitive graphs
