Signed graph coloring
From MaRDI portal
Publication:1165249
DOI10.1016/0012-365X(82)90144-3zbMath0487.05027OpenAlexW2092825420MaRDI QIDQ1165249
Publication date: 1982
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(82)90144-3
Related Items (93)
Signed graphs and the freeness of the Weyl subarrangements of type \(B_\ell\) ⋮ Coloring signed graphs using DFS ⋮ A note on complex-4-colorability of signed planar graphs ⋮ The chromatic spectrum of signed graphs ⋮ Balanced decompositions of a signed graph ⋮ The complexity of signed graph and edge-coloured graph homomorphisms ⋮ Increasing spanning forests in graphs and simplicial complexes ⋮ Walk-powers and homomorphism bounds of planar signed graphs ⋮ Total graph of a signed graph ⋮ Coloring permutation-gain graphs ⋮ Generalized signed graphs of large girth and large chromatic number ⋮ A categorification for the signed chromatic polynomial ⋮ Circuit Covers of Signed Graphs ⋮ Lattice point counts for the Shi arrangement and other affinographic hyperplane arrangements ⋮ The number of nowhere-zero flows on graphs and signed graphs ⋮ Coloring problem of signed interval graphs ⋮ Whitney Numbers of Combinatorial Geometries and Higher-Weight Dowling Lattices ⋮ SIGNED COMPLETE GRAPHS ON SIX VERTICES AND THEIR FRUSTRATION INDICES ⋮ Signed planar graphs with given circular chromatic numbers ⋮ The odd-valued chromatic polynomial of a signed graph ⋮ Link complexes of subspace arrangements ⋮ Strongly even cycle decomposable 4-regular line graphs ⋮ A generalization of Noel-Reed-Wu theorem to signed graphs ⋮ Hajós-like theorem for signed graphs ⋮ Characteristic and Ehrhart polynomials ⋮ On the determinant of the Laplacian matrix of a complex unit gain graph ⋮ 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 ⋮ Conformal Decomposition of Integral Tensions and Potentials of Signed Graphs ⋮ On colorings and orientations of signed graphs ⋮ The circular chromatic number of signed series-parallel graphs of given girth ⋮ Hyperoctahedral Eulerian idempotents, Hodge decompositions, and signed graph coloring complexes ⋮ Signed bipartite circular cliques and a bipartite analogue of Grötzsch's theorem ⋮ Mapping sparse signed graphs to (K2k,M) $({K}_{2k},M)$ ⋮ List homomorphisms to separable signed graphs ⋮ Choosability in signed planar graphs ⋮ Min orderings and list homomorphism dichotomies for signed and unsigned graphs ⋮ Separating signatures in signed planar graphs ⋮ Six signed Petersen graphs, and their automorphisms ⋮ Symmetric set coloring of signed graphs ⋮ \(4\)-colouring of generalized signed planar graphs ⋮ The list-coloring function of signed graphs ⋮ Vizing's adjacency lemma on edge chromatic critical signed graphs and its applications ⋮ The chromatic number of a signed graph ⋮ Relations between Möbius and coboundary polynomials ⋮ Not all planar graphs are in PURE-4-DIR ⋮ Signed graphs ⋮ Colouring of generalized signed triangle-free planar graphs ⋮ Tutte's dichromate for signed graphs ⋮ Chromatic invariants of 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 ⋮ Orientation of signed graphs ⋮ Factoring the characteristic polynomial of a lattice ⋮ A bivariate chromatic polynomial for signed 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 ⋮ Coloring complexes and arrangements ⋮ Graph Homology and Stability of Coupled Oscillator Networks ⋮ Eigenvalues and chromatic number of a signed graph ⋮ Unnamed Item ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ Inside-out polytopes ⋮ Edge coloring signed graphs ⋮ A refinement of choosability of graphs ⋮ Circular chromatic number of signed graphs ⋮ The flow and tension spaces and lattices of signed graphs ⋮ Conformal decomposition of integral flows on signed graphs with outer-edges ⋮ The chromatic number of joins of signed graphs ⋮ Biased graphs. I: Bias, balance, and gains ⋮ Coxeter submodular functions and deformations of Coxeter permutahedra ⋮ How colorful the signed graph? ⋮ The circular chromatic numbers of signed series-parallel graphs ⋮ The characters of the wreath product group acting on the homology groups of the Dowling lattices ⋮ Chromatic number and orientations of graphs and signed graphs ⋮ Density of \(C_{-4}\)-critical signed graphs ⋮ Flow polynomials of a signed graph ⋮ Unlabeled signed graph coloring ⋮ Complexity of planar signed graph homomorphisms to cycles ⋮ Alon-Tarsi number and modulo Alon-Tarsi number of signed graphs ⋮ Whitney numbers of matroid extensions and co-extensions ⋮ List homomorphism problems for signed trees ⋮ Lattice points in orthotopes and a huge polynomial Tutte invariant of weighted gain graphs ⋮ Complex and homomorphic chromatic number of signed planar simple graphs ⋮ Edge coloring of the signed generalized Petersen graph
Cites Work
- Signed graphs
- Chromatic invariants of signed graphs
- Orientation of signed graphs
- Acyclic orientations of graphs
- An introduction to chromatic polynomials
- [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
This page was built for publication: Signed graph coloring
