Homomorphisms of graphs into odd cycles
From MaRDI portal
Publication:3032266
DOI10.1002/jgt.3190120108zbMath0691.05013OpenAlexW2033563973MaRDI QIDQ3032266
Publication date: 1988
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190120108
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items
Minimal universal and dense minor closed classes, Graph homomorphisms into the five-cycle, On multiplicative graphs and the product conjecture, Smallest \(C_{2 \ell + 1}\)-critical graphs of odd-girth \(2 k + 1\), On the Structure of Graphs with Given Odd Girth and Large Minimum Degree, On the adaptable chromatic number of graphs, The complexity of the \(T\)-coloring problem for graphs with small degree, Homomorphism bounds and edge-colourings of \(K_{4}\)-minor-free graphs, \(T\)-colorings of graphs, Universal partial order represented by means of oriented trees and other simple graphs, Finite paths are universal, Odd-\(K_{4}\)'s in stability critical graphs, Coloring graphs with no \(\text{odd-}K_4\), Strong orientations without even directed circuits, High-girth graphs avoiding a minor are nearly bipartite
