Homomorphisms of signed graphs: an update
From MaRDI portal
Publication:2225427
DOI10.1016/j.ejc.2020.103222zbMath1458.05098arXiv1909.05982OpenAlexW3082456181MaRDI QIDQ2225427
Reza Naserasr, Thomas Zaslavsky, Eric Sopena
Publication date: 8 February 2021
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.05982
Graph minors (05C83) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Signed and weighted graphs (05C22)
Related Items (21)
Unnamed Item ⋮ The chromatic number of signed graphs with bounded maximum average degree ⋮ On relative clique number of triangle-free planar colored mixed graphs ⋮ On the signed chromatic number of some classes of graphs ⋮ Generalising the achromatic number to Zaslavsky's colourings of signed graphs ⋮ The 2-colouring problem for $(m,n)$-mixed graphs with switching is polynomial ⋮ Packing Signatures in 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)$ ⋮ Min orderings and list homomorphism dichotomies for signed and unsigned graphs ⋮ Separating signatures in signed planar graphs ⋮ On the pushable chromatic number of various types of grids ⋮ Circular \({\boldsymbol{(4-\epsilon )}}\) -Coloring of Some Classes of Signed Graphs ⋮ Extended double covers and homomorphism bounds of signed graphs ⋮ On the chromatic numbers of signed triangular and hexagonal grids ⋮ Unnamed Item ⋮ Circular chromatic number of signed graphs ⋮ Density of \(C_{-4}\)-critical signed graphs ⋮ Homomorphisms of sparse signed graphs ⋮ List homomorphism problems for signed trees ⋮ Complex and homomorphic chromatic number of signed planar simple graphs
Cites Work
- Coloring signed graphs using DFS
- How colorful the signed graph?
- Homomorphisms and edge-colourings of planar graphs
- The chromatic number of a signed graph
- Edge-switching homomorphisms of edge-coloured graphs
- Signed graphs
- Signed graph coloring
- A simple algorithm to detect balance in signed graphs
- Chromatic invariants of signed graphs
- Hajos' graph-coloring conjecture: Variations and counterexamples
- A mathematical bibliography of signed and gain graphs and allied areas
- On the 4-color theorem for signed graphs
- The complexity of signed graph and edge-coloured graph homomorphisms
- Walk-powers and homomorphism bounds of planar signed graphs
- On the notion of balance of a signed graph
- Mapping Planar Graphs into Projective Cubes
- Characterizations of signed graphs
- Circular coloring of signed graphs
- (2 + ?)-Coloring of planar graphs with large odd-girth
- Homomorphisms of Signed Graphs
- Homomorphisms of 2‐Edge‐Colored Triangle‐Free Planar Graphs
- Circular chromatic number of planar graphs of large odd girth
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Homomorphisms of signed graphs: an update
