Concepts of signed graph coloring
From MaRDI portal
Publication:2225432
DOI10.1016/j.ejc.2020.103226zbMath1458.05100arXiv1909.09381OpenAlexW2974130621MaRDI QIDQ2225432
Alexander Vogel, Eckhard Steffen
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.09381
Related Items (7)
A categorification for the signed chromatic polynomial ⋮ The odd-valued chromatic polynomial of a signed graph ⋮ Generalising the achromatic number to Zaslavsky's colourings of signed graphs ⋮ Symmetric set coloring of signed graphs ⋮ Vizing's adjacency lemma on edge chromatic critical signed graphs and its applications ⋮ Bounds for the chromatic index of signed multigraphs ⋮ Complex and homomorphic chromatic number of signed planar simple graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Coloring signed graphs using DFS
- Degree choosable signed graphs
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
- List colourings of planar graphs
- How colorful the signed graph?
- Choosability in signed planar graphs
- The chromatic number of a signed graph
- Signed graphs
- Signed graph coloring
- A simple algorithm to detect balance in signed graphs
- Chromatic invariants of signed graphs
- Erratum to: T. Zaslavsky, signed graphs
- Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
- On acyclic colorings of planar graphs
- Homomorphisms of edge-colored graphs and Coxeter groups
- Every planar graph is 5-choosable
- Good and semi-strong colorings of oriented planar graphs
- A short list color proof of Grötzsch's theorem
- A complexity dichotomy for signed \(\mathbf{H}\)-colouring
- Every signed planar graph without cycles of length from 4 to 8 is 3-colorable
- On the achromatic number of signed graphs
- Colouring of generalized signed triangle-free planar graphs
- Colored homomorphisms of colored mixed graphs
- The signed chromatic number of the projective plane and Klein bottle and antipodal graph coloring
- Biased graphs. III: Chromatic and dichromatic invariants
- Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable
- A refinement of choosability of graphs
- Signed coloring of 2-dimensional grids
- Alon-Tarsi number and modulo Alon-Tarsi number of signed graphs
- The complexity of signed graph and edge-coloured graph homomorphisms
- Totally frustrated states in the chromatic theory of gain graphs
- On the coloring of signed graphs
- Line-coloring of signed graphs
- The chromatic spectrum of signed graphs
- On the notion of balance of a signed graph
- Relative Clique Number of Planar Signed Graphs
- Steiner trees, partial 2–trees, and minimum IFI networks
- Star chromatic number
- Circular coloring of signed graphs
- Homomorphisms of Signed Graphs
- Homomorphisms of 2‐Edge‐Colored Triangle‐Free Planar Graphs
- A note on a Brooks' type theorem for DP‐coloring
- The Complexity of Homomorphisms of Signed Graphs and Signed Constraint Satisfaction
- A note on group colorings
- Circular chromatic number: A survey
This page was built for publication: Concepts of signed graph coloring
