On the existence of graphs which can colour every regular graph
From MaRDI portal
Publication:6162043
DOI10.1016/j.dam.2023.05.006zbMath1516.05069arXiv2110.13684MaRDI QIDQ6162043
Jean Paul Zerafa, Gloria Tabarelli, Giuseppe Mazzuoccolo
Publication date: 15 June 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.13684
05C15: Coloring of graphs and hypergraphs
Related Items
\(H\)-colorings for 4-regular graphs, Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sparsely intersecting perfect matchings in cubic graphs
- Fulkerson's conjecture and circuit covers
- Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching
- A remark on Petersen coloring conjecture of Jaeger
- The equivalence of two conjectures of Berge and Fulkerson
- An equivalent formulation of the Fan-Raspaud Conjecture and related problems
- Indecomposabler-graphs and some other counterexamples
- On Sylvester Colorings of Cubic Graphs
- S_12 and P_12-colorings of cubic graphs
- An Upper Bound for the Excessive Index of an r‐Graph
- Polyhedral decompositions of cubic graphs
- Blocking and anti-blocking pairs of polyhedra