Chromatic invariants of signed graphs
From MaRDI portal
Cites work
- A Decomposition for Combinatorial Geometries
- Acyclic orientations of graphs
- Complementary matching vectors and the uniform matching extension property
- Möbius inversion in lattices
- On dichromatic polynomials
- On the notion of balance of a signed graph
- Signed graph coloring
- Signed graphs
- The Geometry of Root Systems and Signed Graphs
- The Tutte polynomial
Cited in
(27)- Complementary matching vectors and the uniform matching extension property
- Signed graphs
- Signed graph coloring
- Orientation of signed graphs
- Characteristic and Ehrhart polynomials
- Biased graphs IV: Geometrical realizations
- A framework for Coxeter spectral classification of finite posets and their mesh geometries of roots.
- Tutte's dichromate for signed graphs
- Homomorphisms of signed graphs: an update
- Concepts of signed graph coloring
- The complexity of signed graph and edge-coloured graph homomorphisms
- The entropic discriminant
- Characteristic polynomials, Ehrhart quasi-polynomials, and torus groups.
- The chromatic spectrum of signed graphs
- Six signed Petersen graphs, and their automorphisms
- Coloring problem of signed interval graphs
- Degree choosable signed graphs
- Graph theory (algorithmic, algebraic, and metric problems)
- On colorings and orientations of signed graphs
- A signed graph analogue of acyclic orientation polynomials and the sink theorem
- The homomorphism and coloring of the direct product of signed graphs
- On colorings and orientations of signed graphs. II
- Biased graphs. I: Bias, balance, and gains
- How colorful the signed graph?
- Complexity of planar signed graph homomorphisms to cycles
- The chromatic number of a signed graph
- Set maps, umbral calculus, and the chromatic polynomial
This page was built for publication: Chromatic invariants of signed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1171067)
