Homomorphisms of signed graphs
From MaRDI portal
Publication:5265329
DOI10.1002/JGT.21817zbMATH Open1322.05069OpenAlexW1679590246MaRDI QIDQ5265329FDOQ5265329
Reza Naserasr, Edita Rollová, Éric Sopena
Publication date: 23 July 2015
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.21817
Recommendations
Cites Work
- Signed graphs
- On the notion of balance of a signed graph
- On the complexity of H-coloring
- On acyclic colorings of planar graphs
- Grad and classes with bounded expansion. III: Restricted graph homomorphism dualities
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- Good and semi-strong colorings of oriented planar graphs
- Homomorphisms from sparse graphs with large girth.
- Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs
- Edge-colouring eight-regular planar graphs
- Nowhere-zero integral flows on a bidirected graph
- Circular flows of nearly Eulerian graphs and vertex-splitting
- Hajos' graph-coloring conjecture: Variations and counterexamples
- Characterizations of signed graphs
- Homomorphisms and edge-colourings of planar graphs
- Homomorphisms of triangle-free graphs without a \(K_{5}\)-minor
- Homomorphisms of edge-colored graphs and Coxeter groups
- Beweis einer Abschwächung der Hadwiger-Vermutung
- Colored homomorphisms of colored mixed graphs
- Homomorphisms of 2-edge-colored graphs
- On a new reformulation of Hadwiger's conjecture
- Edge-switching homomorphisms of edge-coloured graphs
- The Complexity of Homomorphisms of Signed Graphs and Signed Constraint Satisfaction
- Title not available (Why is that?)
- Mapping planar graphs into projective cubes
Cited In (56)
- The chromatic number of signed graphs with bounded maximum average degree
- Hajós-like theorem for signed graphs
- Homomorphism bounds of signed bipartite \(K_4\)-minor-free graphs and edge-colorings of \(2k\)-regular \(K_4\)-minor-free multigraphs
- Relative Clique Number of Planar Signed Graphs
- Homomorphisms of signed graphs: an update
- Signed Graphs and Geometry
- Circular \({\boldsymbol{(4-\epsilon )}}\) -Coloring of Some Classes of Signed Graphs
- List homomorphism problems for signed trees
- Title not available (Why is that?)
- Concepts of signed graph coloring
- Coloring problem of signed interval graphs
- Characterizations of line graphs in signed and gain graphs
- The 2-colouring problem for $(m,n)$-mixed graphs with switching is polynomial
- Title not available (Why is that?)
- On the signed chromatic number of some classes of graphs
- List homomorphisms to separable signed graphs
- Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity
- Complex and homomorphic chromatic number of signed planar simple graphs
- Colouring of \(S\)-labelled planar graphs
- Homomorphisms of binary Cayley graphs
- Packing Signatures in Signed Graphs
- The complexity of signed graph and edge-coloured graph homomorphisms
- On the chromatic numbers of signed triangular and hexagonal grids
- SIGNED COMPLETE GRAPHS ON SIX VERTICES AND THEIR FRUSTRATION INDICES
- On cospectrality of gain graphs
- Density of \(C_{-4}\)-critical signed graphs
- Analogues of cliques for \((m,n)\)-colored mixed graphs
- On Cartesian products of signed graphs
- Homomorphisms of sparse signed graphs
- Signed bipartite circular cliques and a bipartite analogue of Grötzsch's theorem
- Mapping sparse signed graphs to (K2k,M) $({K}_{2k},M)$
- On relative clique number of triangle-free planar colored mixed graphs
- Title not available (Why is that?)
- Complexity of planar signed graph homomorphisms to cycles
- The number of switching isomorphism classes of signed graphs associated with particular graphs
- On the pushable chromatic number of various types of grids
- On the achromatic number of signed graphs
- Non-isomorphic signatures on some generalised Petersen graph
- Triangle-free projective-planar graphs with diameter two: domination and characterization
- Frustration-critical signed graphs
- A complexity dichotomy for signed \(\mathbf{H}\)-colouring
- Circular chromatic number of signed graphs
- Chromatic polynomials of 2-edge-coloured graphs
- Relative clique number of planar signed graphs
- Homomorphisms of partial \(t\)-trees and edge-colorings of partial 3-trees
- Homomorphisms of 2‐Edge‐Colored Triangle‐Free Planar Graphs
- Chromatic number and orientations of graphs and signed graphs
- Title not available (Why is that?)
- Walk-powers and homomorphism bounds of planar signed graphs
- Title not available (Why is that?)
- Density of 3-critical signed graphs
- The chromatic number of 2-edge-colored and signed graphs of bounded maximum degree
- Circular coloring of signed bipartite planar graphs
- Extended double covers and homomorphism bounds of signed graphs
- Homomorphisms to small negative even cycles
- On coloring parameters of triangle-free planar \((n, m)\)-graphs
This page was built for publication: Homomorphisms of signed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5265329)
