Homomorphisms of graphs into odd cycles
From MaRDI portal
Recommendations
Cited in
(24)- Odd-\(K_{4}\)'s in stability critical graphs
- Graph homomorphisms into the five-cycle
- On multiplicative graphs and the product conjecture
- \(T\)-colorings of graphs
- The complexity of the \(T\)-coloring problem for graphs with small degree
- Coloring graphs with no \(\text{odd-}K_4\)
- Strong orientations without even directed circuits
- Homomorphisms of products of graphs into graphs without four cycles
- Universal partial order represented by means of oriented trees and other simple graphs
- High-girth graphs avoiding a minor are nearly bipartite
- Homomorphism bounds and edge-colourings of \(K_{4}\)-minor-free graphs
- Smallest \(C_{2 \ell + 1}\)-critical graphs of odd-girth \(2 k + 1\)
- On the adaptable chromatic number of graphs
- Homomorphisms of binary Cayley graphs
- Odd cycle transversal in mixed graphs
- On the Structure of Graphs with Given Odd Girth and Large Minimum Degree
- scientific article; zbMATH DE number 3974975 (Why is no real title available?)
- scientific article; zbMATH DE number 4008417 (Why is no real title available?)
- scientific article; zbMATH DE number 4031753 (Why is no real title available?)
- scientific article; zbMATH DE number 1416059 (Why is no real title available?)
- Finite paths are universal
- Towards the Chen-Raspaud conjecture
- \(C_{2k+1}\)-coloring of bounded-diameter graphs
- Minimal universal and dense minor closed classes
This page was built for publication: Homomorphisms of graphs into odd cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3032266)
