Homomorphisms of sparse signed graphs

DOI10.37236/8478OpenAlexW3041680544MaRDI QIDQ782945

Clément Charpentier, Reza Naserasr, Eric Sopena

Publication date: 29 July 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.37236/8478

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Signed and weighted graphs (05C22)

Related Items

The chromatic number of signed graphs with bounded maximum average degree ⋮ Mapping sparse signed graphs to (K2k,M) $({K}_{2k},M)$ ⋮ Homomorphisms to small negative even cycles ⋮ Circular chromatic number of signed graphs ⋮ Density of \(C_{-4}\)-critical signed graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An introduction to the discharging method via graph coloring
• Signed graphs
• Homomorphisms of edge-colored graphs and Coxeter groups
• Good and semi-strong colorings of oriented planar graphs
• Homomorphisms of signed graphs: an update
• The complexity of signed graph and edge-coloured graph homomorphisms
• Mapping Planar Graphs into Projective Cubes
• Circular flows of nearly Eulerian graphs and vertex-splitting
• The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
• (2 + ?)-Coloring of planar graphs with large odd-girth
• Homomorphisms of Signed Graphs
• Homomorphisms of 2‐Edge‐Colored Triangle‐Free Planar Graphs
• The Complexity of Homomorphisms of Signed Graphs and Signed Constraint Satisfaction