Homomorphism bounds and edge-colourings of \(K_{4}\)-minor-free graphs
From MaRDI portal
Publication:1989955
DOI10.1016/j.jctb.2017.01.001zbMath1398.05081arXiv1610.03999OpenAlexW3103228894MaRDI QIDQ1989955
Reza Naserasr, Florent Foucaud, Laurent Beaudou
Publication date: 29 October 2018
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.03999
Related Items (9)
Unnamed Item ⋮ Walk-powers and homomorphism bounds of planar signed graphs ⋮ Smallest \(C_{2 \ell + 1}\)-critical graphs of odd-girth \(2 k + 1\) ⋮ On the signed chromatic number of some classes of graphs ⋮ Homomorphism bounds of signed bipartite \(K_4\)-minor-free graphs and edge-colorings of \(2k\)-regular \(K_4\)-minor-free multigraphs ⋮ Circular coloring and fractional coloring in planar graphs ⋮ Extended double covers and homomorphism bounds of signed graphs ⋮ Homomorphisms of partial \(t\)-trees and edge-colorings of partial 3-trees ⋮ Triangle-free projective-planar graphs with diameter two: domination and characterization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Edge-colouring seven-regular planar graphs
- Edge-colouring eight-regular planar graphs
- Finite dualities and map-critical graphs on a fixed surface
- A fast algorithm for minimum weight odd circuits and cuts in planar graphs
- Homomorphisms and edge-colourings of planar graphs
- Packing six \(T\)-joins in plane graphs
- On the chromatic number of cube-like graphs
- The circular chromatic number of series-parallel graphs of large odd girth
- Tight relation between the circular chromatic number and the girth of series-parallel graphs
- Homomorphism bounded classes of graphs
- Grad and classes with bounded expansion. III: Restricted graph homomorphism dualities
- Cuts and bounds
- Walk-powers and homomorphism bounds of planar signed graphs
- Colouring series-parallel graphs
- Mapping Planar Graphs into Projective Cubes
- Homomorphisms of graphs into odd cycles
- Density of universal classes of series-parallel graphs
- Fractional, Circular, and Defective Coloring of Series-Parallel Graphs
- The NP-Completeness of Edge-Coloring
- On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
- On the hardness of approximating minimization problems
- Acyclic graph coloring and the complexity of the star chromatic number
- (2 + ?)-Coloring of planar graphs with large odd-girth
- Reducibility among Combinatorial Problems
- Maximum matching and a polyhedron with 0,1-vertices
- Optimal edge-colourings for a class of planar multigraphs
This page was built for publication: Homomorphism bounds and edge-colourings of \(K_{4}\)-minor-free graphs
