Circular chromatic number of signed graphs
From MaRDI portal
Publication:2034071
DOI10.37236/9938zbMath1466.05090arXiv2010.07525OpenAlexW3173806834MaRDI QIDQ2034071
Reza Naserasr, Zhouningxin Wang, Xuding Zhu
Publication date: 21 June 2021
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.07525
Related Items (10)
Signed planar graphs with given circular chromatic numbers ⋮ The circular chromatic number of signed series-parallel graphs of given girth ⋮ Signed bipartite circular cliques and a bipartite analogue of Grötzsch's theorem ⋮ Mapping sparse signed graphs to (K2k,M) $({K}_{2k},M)$ ⋮ Symmetric set coloring of signed graphs ⋮ Circular \({\boldsymbol{(4-\epsilon )}}\) -Coloring of Some Classes of Signed Graphs ⋮ Homomorphisms to small negative even cycles ⋮ The circular chromatic numbers of signed series-parallel graphs ⋮ Density of \(C_{-4}\)-critical signed graphs ⋮ Complex and homomorphic chromatic number of signed planar simple graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Coloring, sparseness and girth
- Nowhere-zero 3-flows and modulo \(k\)-orientations
- Complexity of planar signed graph homomorphisms to cycles
- Homomorphisms of sparse signed graphs
- The chromatic number of a signed graph
- Signed graphs
- Signed graph coloring
- Hajos' graph-coloring conjecture: Variations and counterexamples
- Planar graphs with circular chromatic numbers between 3 and 4
- The circular chromatic number of series-parallel graphs of large odd girth
- A note on not-4-list colorable planar graphs
- Density of 5/2-critical graphs
- High-girth graphs avoiding a minor are nearly bipartite
- On the 4-color theorem for signed graphs
- Homomorphisms of signed graphs: an update
- A refinement of choosability of graphs
- The complexity of signed graph and edge-coloured graph homomorphisms
- On the odd-minor variant of Hadwiger's conjecture
- Circular flows of nearly Eulerian graphs and vertex-splitting
- Star chromatic number
- Star chromatic numbers and products of graphs
- A simple proof of Moser's theorem
- Circular coloring of signed graphs
- Acyclic graph coloring and the complexity of the star chromatic number
- Density of the circular chromatic numbers of series-parallel graphs
- (2 + ?)-Coloring of planar graphs with large odd-girth
- Homomorphisms of Signed Graphs
- The star-chromatic number of planar graphs
- Circular chromatic number: A survey
This page was built for publication: Circular chromatic number of signed graphs
