Concepts of signed graph coloring
From MaRDI portal
Publication:2225432
DOI10.1016/J.EJC.2020.103226zbMATH Open1458.05100arXiv1909.09381OpenAlexW2974130621MaRDI QIDQ2225432FDOQ2225432
Authors: Alexander Vogel, Eckhard Steffen 
Publication date: 8 February 2021
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Abstract: This paper surveys recent development of concepts related to coloring of signed graphs. Various approaches are presented and discussed.
Full work available at URL: https://arxiv.org/abs/1909.09381
Cites Work
- Signed graphs
- Signed graph coloring
- Biased graphs. III: Chromatic and dichromatic invariants
- On the notion of balance of a signed graph
- On acyclic colorings of planar graphs
- Title not available (Why is that?)
- Every planar graph is 5-choosable
- Coloring signed graphs using DFS
- Title not available (Why is that?)
- The chromatic number of a signed graph
- Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
- Good and semi-strong colorings of oriented planar graphs
- On the coloring of signed graphs
- Steiner trees, partial 2–trees, and minimum IFI networks
- A short list color proof of Grötzsch's theorem
- Title not available (Why is that?)
- Star chromatic number
- Circular chromatic number: A survey
- Relative clique number of planar signed graphs
- List colourings of planar graphs
- Erratum to: T. Zaslavsky, signed graphs
- A note on group colorings
- Line-coloring of signed graphs
- Chromatic invariants of signed graphs
- Homomorphisms of edge-colored graphs and Coxeter groups
- The chromatic spectrum of signed graphs
- Degree choosable signed graphs
- How colorful the signed graph?
- Choosability in signed planar graphs
- A simple algorithm to detect balance in signed graphs
- Colored homomorphisms of colored mixed graphs
- The complexity of signed graph and edge-coloured graph homomorphisms
- Homomorphisms of 2-edge-colored triangle-free planar graphs
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
- A complexity dichotomy for signed \(\mathbf{H}\)-colouring
- Homomorphisms of signed graphs
- The complexity of homomorphisms of signed graphs and signed constraint satisfaction
- Homomorphisms of planar signed graphs to signed projective cubes
- Colouring of generalized signed triangle-free planar graphs
- Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable
- On the achromatic number of signed graphs
- A refinement of choosability of graphs
- Every signed planar graph without cycles of length from 4 to 8 is 3-colorable
- Circular coloring of signed graphs
- A note on a Brooks' type theorem for DP-coloring
- The signed chromatic number of the projective plane and Klein bottle and antipodal graph coloring
- Alon-Tarsi number and modulo Alon-Tarsi number of signed graphs
- Lower bounds for the colored mixed chromatic number of some classes of graphs.
- Totally frustrated states in the chromatic theory of gain graphs
- Signed coloring of 2-dimensional grids
Cited In (10)
- Graphs on groups in terms of the order of elements: a review
- The odd-valued chromatic polynomial of a signed graph
- Bounds for the chromatic index of signed multigraphs
- Complex and homomorphic chromatic number of signed planar simple graphs
- A categorification for the signed chromatic polynomial
- Symmetric set coloring of signed graphs
- Generalising the achromatic number to Zaslavsky's colourings of signed graphs
- Signed coloring of 2-dimensional grids
- On colorings and orientations of signed graphs
- Vizing's adjacency lemma on edge chromatic critical signed graphs and its applications
This page was built for publication: Concepts of signed graph coloring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2225432)
