Signed bipartite circular cliques and a bipartite analogue of Grötzsch's theorem

DOI10.1016/j.disc.2023.113604zbMath1522.05180arXiv2109.12618OpenAlexW3202234079WikidataQ122874857 ScholiaQ122874857MaRDI QIDQ6080558

Reza Naserasr, Zhouningxin Wang

Publication date: 4 October 2023

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2109.12618

zbMATH Keywords

graph homomorphismplanar graphGrötzsch's theorembipartite circular clique

Mathematics Subject Classification ID

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

Related Items (1)

Homomorphisms to small negative even cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Nowhere-zero 3-flows and modulo \(k\)-orientations
• Packing six \(T\)-joins in plane graphs
• The chromatic number of a signed graph
• Edge-switching homomorphisms of edge-coloured graphs
• Signed graphs
• Signed graph coloring
• Density of 5/2-critical graphs
• Circular chromatic number of signed graphs
• The circular chromatic numbers of signed series-parallel graphs
• Density of \(C_{-4}\)-critical signed graphs
• On the density of \(C_7\)-critical graphs
• Circular flows via extended Tutte orientations
• Homomorphisms of signed graphs: an update
• Circular Flows in Planar Graphs
• Homomorphisms of Signed Graphs
• Packing Signatures in Signed Graphs
• Circular \({\boldsymbol{(4-\epsilon )}}\) -Coloring of Some Classes of Signed Graphs

This page was built for publication: Signed bipartite circular cliques and a bipartite analogue of Grötzsch's theorem