Chromatic invariants of signed graphs
From MaRDI portal
Publication:1171067
DOI10.1016/0012-365X(82)90225-4zbMath0498.05030MaRDI QIDQ1171067
Publication date: 1982
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
The chromatic spectrum of signed graphs ⋮ The complexity of signed graph and edge-coloured graph homomorphisms ⋮ Coloring problem of signed interval graphs ⋮ Characteristic and Ehrhart polynomials ⋮ On colorings and orientations of signed graphs ⋮ Six signed Petersen graphs, and their automorphisms ⋮ The chromatic number of a signed graph ⋮ Complementary matching vectors and the uniform matching extension property ⋮ A framework for Coxeter spectral classification of finite posets and their mesh geometries of roots. ⋮ The entropic discriminant ⋮ Signed graphs ⋮ Biased graphs IV: Geometrical realizations ⋮ Signed graph coloring ⋮ Tutte's dichromate for signed graphs ⋮ Homomorphisms of signed graphs: an update ⋮ Concepts of signed graph coloring ⋮ Set maps, umbral calculus, and the chromatic polynomial ⋮ Orientation of signed graphs ⋮ Degree choosable signed graphs ⋮ Characteristic polynomials, Ehrhart quasi-polynomials, and torus groups. ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ Biased graphs. I: Bias, balance, and gains ⋮ How colorful the signed graph? ⋮ Complexity of planar signed graph homomorphisms to cycles
Cites Work
- Complementary matching vectors and the uniform matching extension property
- Signed graphs
- Signed graph coloring
- The Tutte polynomial
- Möbius inversion in lattices
- Acyclic orientations of graphs
- On the notion of balance of a signed graph
- The Geometry of Root Systems and Signed Graphs
- On dichromatic polynomials
- A Decomposition for Combinatorial Geometries