Homomorphisms of Signed Graphs

From MaRDI portal
Revision as of 21:13, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5265329

DOI10.1002/jgt.21817zbMath1322.05069OpenAlexW1679590246MaRDI QIDQ5265329

Reza Naserasr, Edita Rollová, Eric 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




Related Items (50)

Characterizations of line graphs in signed and gain graphsGraph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexityThe complexity of signed graph and edge-coloured graph homomorphismsUnnamed ItemWalk-powers and homomorphism bounds of planar signed graphsThe chromatic number of signed graphs with bounded maximum average degreeNon-isomorphic signatures on some generalised Petersen graphOn cospectrality of gain graphsColoring problem of signed interval graphsSIGNED COMPLETE GRAPHS ON SIX VERTICES AND THEIR FRUSTRATION INDICESA complexity dichotomy for signed \(\mathbf{H}\)-colouringOn relative clique number of triangle-free planar colored mixed graphsHajós-like theorem for signed graphsAnalogues of cliques for \((m,n)\)-colored mixed graphsOn the signed chromatic number of some classes of graphsThe number of switching isomorphism classes of signed graphs associated with particular graphsRelative clique number of planar signed graphsHomomorphism bounds of signed bipartite \(K_4\)-minor-free graphs and edge-colorings of \(2k\)-regular \(K_4\)-minor-free multigraphsThe 2-colouring problem for $(m,n)$-mixed graphs with switching is polynomialPacking Signatures in Signed GraphsSigned bipartite circular cliques and a bipartite analogue of Grötzsch's theoremMapping sparse signed graphs to (K2k,M) $({K}_{2k},M)$List homomorphisms to separable signed graphsChromatic polynomials of 2-edge-coloured graphsOn the pushable chromatic number of various types of gridsCircular \({\boldsymbol{(4-\epsilon )}}\) -Coloring of Some Classes of Signed GraphsThe chromatic number of 2-edge-colored and signed graphs of bounded maximum degreeExtended double covers and homomorphism bounds of signed graphsHomomorphisms to small negative even cyclesHomomorphisms of partial \(t\)-trees and edge-colorings of partial 3-treesTriangle-free projective-planar graphs with diameter two: domination and characterizationOn the achromatic number of signed graphsUnnamed ItemHomomorphisms of signed graphs: an updateConcepts of signed graph coloringColouring of \(S\)-labelled planar graphsOn Cartesian products of signed graphsOn the chromatic numbers of signed triangular and hexagonal gridsUnnamed ItemRelative Clique Number of Planar Signed GraphsCircular chromatic number of signed graphsHomomorphisms of binary Cayley graphsChromatic number and orientations of graphs and signed graphsDensity of \(C_{-4}\)-critical signed graphsComplexity of planar signed graph homomorphisms to cyclesFrustration-critical signed graphsHomomorphisms of sparse signed graphsList homomorphism problems for signed treesHomomorphisms of 2‐Edge‐Colored Triangle‐Free Planar GraphsComplex and homomorphic chromatic number of signed planar simple graphs



Cites Work


This page was built for publication: Homomorphisms of Signed Graphs