Homomorphisms to small negative even cycles

DOI10.1016/j.ejc.2024.103941OpenAlexW4392042050MaRDI QIDQ6201924

Yongtang Shi, Chun-Yan Wei, Zhouningxin Wang, Jiaao Li

Publication date: 26 March 2024

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2024.103941

zbMATH Keywords

signed planar graphsJaeger's circular flow conjecture

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Signed and weighted graphs (05C22)

Cites Work

• Unnamed Item
• Unnamed Item
• Group-colouring, group-connectivity, claw-decompositions, and orientations in 5-edge-connected planar graphs
• Ore's conjecture for \(k=4\) and Grötzsch's theorem
• Graph factors modulo \(k\)
• The weak 3-flow conjecture and the weak circular flow conjecture
• Nowhere-zero 3-flows and modulo \(k\)-orientations
• Ore's conjecture on color-critical graphs is almost true
• Homomorphisms of sparse signed graphs
• The chromatic number of a signed graph
• Homomorphisms from sparse graphs with large girth.
• Density of 5/2-critical graphs
• Counterexamples to Jaeger's circular flow conjecture
• Circular chromatic number of signed graphs
• Density of \(C_{-4}\)-critical signed graphs
• On the density of \(C_7\)-critical graphs
• Circular flows via extended Tutte orientations
• On the 4-color theorem for signed graphs
• Factorizing regular graphs
• On the degrees of the vertices of a directed graph
• Circular flows of nearly Eulerian graphs and vertex-splitting
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Mod (2p + 1)-Orientations and $K_{1,2p+1}$-Decompositions
• Star chromatic number
• Circular Flows in Planar Graphs
• Homomorphisms of Signed Graphs
• Group Connectivity, Strongly Z_m-Connectivity, and Edge Disjoint Spanning Trees
• Group chromatic number of planar graphs of girth at least 4
• A Contribution to the Theory of Chromatic Polynomials
• Circular chromatic number of planar graphs of large odd girth
• Signed bipartite circular cliques and a bipartite analogue of Grötzsch's theorem
• Mapping sparse signed graphs to (K2k,M) $({K}_{2k},M)$

This page was built for publication: Homomorphisms to small negative even cycles