The chromatic number of a signed graph
From MaRDI portal
Publication:907266
zbMath1329.05116arXiv1412.6349MaRDI QIDQ907266
Edita Máčajová, Martin Škoviera, Andre Raspaud
Publication date: 25 January 2016
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.6349
Related Items (49)
Coloring signed graphs using DFS ⋮ The chromatic spectrum of signed graphs ⋮ Coloring permutation-gain graphs ⋮ Generalized signed graphs of large girth and large chromatic number ⋮ A categorification for the signed chromatic polynomial ⋮ Coloring problem of signed interval graphs ⋮ Signed planar graphs with given circular chromatic numbers ⋮ A generalization of Noel-Reed-Wu theorem to signed graphs ⋮ Hajós-like theorem for signed graphs ⋮ Generalising the achromatic number to Zaslavsky's colourings of signed graphs ⋮ Edge coloring of signed graphs ⋮ Signed planar graphs with \(\Delta \geq 8\) are \(\Delta\)-edge-colorable ⋮ Every signed planar graph without cycles of length from 4 to 8 is 3-colorable ⋮ Planar graphs without intersecting 5-cycles are signed-4-choosable ⋮ Signed colouring and list colouring of k‐chromatic graphs ⋮ On colorings and orientations of signed graphs ⋮ 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)$ ⋮ Separating signatures in signed planar graphs ⋮ Symmetric set coloring of signed graphs ⋮ \(4\)-colouring of generalized signed planar graphs ⋮ The list-coloring function of signed graphs ⋮ Variable degeneracy on toroidal graphs ⋮ Vizing's adjacency lemma on edge chromatic critical signed graphs and its applications ⋮ Homomorphisms to small negative even cycles ⋮ Not all planar graphs are in PURE-4-DIR ⋮ Colouring of generalized signed triangle-free planar graphs ⋮ Tutte's dichromate for signed graphs ⋮ On the 4-color theorem for signed graphs ⋮ Homomorphisms of signed graphs: an update ⋮ Concepts of signed graph coloring ⋮ Colouring of \(S\)-labelled planar graphs ⋮ Unnamed Item ⋮ Degree choosable signed graphs ⋮ A sufficient condition for DP-4-colorability ⋮ Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable ⋮ Eigenvalues and chromatic number of a signed graph ⋮ Edge coloring signed graphs ⋮ A refinement of choosability of graphs ⋮ Circular chromatic number of signed graphs ⋮ The chromatic number of joins of signed graphs ⋮ The circular chromatic numbers of signed series-parallel graphs ⋮ Chromatic number and orientations of graphs and signed graphs ⋮ Density of \(C_{-4}\)-critical signed graphs ⋮ Cover and variable degeneracy ⋮ Alon-Tarsi number and modulo Alon-Tarsi number of signed graphs ⋮ Complex and homomorphic chromatic number of signed planar simple graphs ⋮ Edge coloring of the signed generalized Petersen graph
Cites Work
This page was built for publication: The chromatic number of a signed graph
