Signed graph coloring
From MaRDI portal
Cites work
Cited in
(98)- Lattice points in orthotopes and a huge polynomial Tutte invariant of weighted gain graphs
- Signed planar graphs with given circular chromatic numbers
- Hajós-like theorem for signed graphs
- Balanced decompositions of a signed graph
- The circular chromatic number of signed series-parallel graphs of given girth
- A note on complex-4-colorability of signed planar graphs
- Unlabeled signed graph coloring
- Not all planar graphs are in PURE-4-DIR
- Homomorphisms of signed graphs: an update
- The list-coloring function of signed graphs
- Hyperoctahedral Eulerian idempotents, Hodge decompositions, and signed graph coloring complexes
- Six signed Petersen graphs, and their automorphisms
- List homomorphism problems for signed trees
- Coloring signed graphs using DFS
- Biased graphs. I: Bias, balance, and gains
- Planar graphs without intersecting 5-cycles are signed-4-choosable
- Lattice point counts for the Shi arrangement and other affinographic hyperplane arrangements
- Graph homology and stability of coupled oscillator networks
- The odd-valued chromatic polynomial of a signed graph
- Edge coloring of the signed generalized Petersen graph
- Coxeter submodular functions and deformations of Coxeter permutahedra
- scientific article; zbMATH DE number 7559391 (Why is no real title available?)
- The characters of the wreath product group acting on the homology groups of the Dowling lattices
- Edge coloring of signed graphs
- Concepts of signed graph coloring
- Link complexes of subspace arrangements
- Signed graphs
- A generalization of Noel-Reed-Wu theorem to signed graphs
- Edge coloring signed graphs
- Min orderings and list homomorphism dichotomies for graphs and signed graphs
- A sufficient condition for DP-4-colorability
- Coloring problem of signed interval graphs
- Coloring permutation-gain graphs
- Colouring of generalized signed triangle-free planar graphs
- Alon-Tarsi number and modulo Alon-Tarsi number of signed graphs
- Chromatic invariants of signed graphs
- The chromatic number of a signed graph
- The chromatic spectrum of signed graphs
- Characteristic and Ehrhart polynomials
- Graph theory (algorithmic, algebraic, and metric problems)
- Increasing spanning forests in graphs and simplicial complexes
- Density of 3-critical signed graphs
- List homomorphisms to separable signed graphs
- Complex and homomorphic chromatic number of signed planar simple graphs
- 4-colouring of generalized signed planar graphs
- Colouring of \(S\)-labelled planar graphs
- On the 4-color theorem for signed graphs
- Generalized signed graphs of large girth and large chromatic number
- The complexity of signed graph and edge-coloured graph homomorphisms
- Signed colouring and list colouring of k‐chromatic graphs
- The number of nowhere-zero flows on graphs and signed graphs
- SIGNED COMPLETE GRAPHS ON SIX VERTICES AND THEIR FRUSTRATION INDICES
- Density of \(C_{-4}\)-critical signed graphs
- An extension of Stanley's symmetric acyclicity theorem to signed graphs
- A categorification for the signed chromatic polynomial
- On the determinant of the Laplacian matrix of a complex unit gain graph
- Strongly even cycle decomposable 4-regular line graphs
- The canonical Tutte polynomial for signed graphs
- Matroids of gain signed graphs
- Coloring complexes and arrangements
- Conformal decomposition of integral tensions and potentials of signed graphs
- Flow polynomials of a signed graph
- Signed bipartite circular cliques and a bipartite analogue of Grötzsch's theorem
- Mapping sparse signed graphs to (K2k,M) $({K}_{2k},M)$
- Signed planar graphs with \(\Delta \geq 8\) are \(\Delta\)-edge-colorable
- Relations between Möbius and coboundary polynomials
- The flow and tension spaces and lattices of signed graphs
- Orientation of signed graphs
- Conformal decomposition of integral flows on signed graphs with outer-edges
- Symmetric set coloring of signed graphs
- Factoring the characteristic polynomial of a lattice
- Complexity of planar signed graph homomorphisms to cycles
- Generalising the achromatic number to Zaslavsky's colourings of signed graphs
- A refinement of choosability of graphs
- A bivariate chromatic polynomial for signed graphs
- The circular chromatic numbers of signed series-parallel graphs
- Every signed planar graph without cycles of length from 4 to 8 is 3-colorable
- scientific article; zbMATH DE number 7614204 (Why is no real title available?)
- On colorings and orientations of signed graphs
- Circuit covers of signed graphs
- Vizing's adjacency lemma on edge chromatic critical signed graphs and its applications
- Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable
- Total graph of a signed graph
- Inside-out polytopes
- Min orderings and list homomorphism dichotomies for signed and unsigned graphs
- Degree choosable signed graphs
- Eigenvalues and chromatic number of a signed graph
- Circular chromatic number of signed graphs
- The chromatic number of joins of signed graphs
- Separating signatures in signed planar graphs
- Whitney numbers of matroid extensions and co-extensions
- Whitney Numbers of Combinatorial Geometries and Higher-Weight Dowling Lattices
- How colorful the signed graph?
- Signed graphs and the freeness of the Weyl subarrangements of type \(B_\ell\)
- Choosability in signed planar graphs
- Chromatic number and orientations of graphs and signed graphs
- Walk-powers and homomorphism bounds of planar signed graphs
- Tutte's dichromate for signed graphs
This page was built for publication: Signed graph coloring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1165249)
