A broken cycle theorem for the restrained chromatic function
From MaRDI portal
Publication:5742940
DOI10.3906/mat-1807-200zbMath1410.05066OpenAlexW2908677193WikidataQ128536425 ScholiaQ128536425MaRDI QIDQ5742940
Publication date: 8 May 2019
Published in: TURKISH JOURNAL OF MATHEMATICS (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3906/mat-1807-200
Graph polynomials (05C31) Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Unnamed Item
- Unnamed Item
- When does the list-coloring function of a graph equal its chromatic polynomial
- An abstraction of Whitney's broken circuit theorem
- \( h\)-vectors of matroids and logarithmic concavity
- The chromatic polynomial and list colorings
- On the NBC-complexes and \(\beta \)-invariants of abstract convex geometries
- Several identities for the characteristic polynomial of a combinatorial geometry
- Broken circuit complexes: Factorizations and generalizations
- Möbius functions of lattices
- Restraints permitting the largest number of colourings
- Interval vertex-coloring of a graph with forbidden colors
- A note on a broken-cycle theorem for hypergraphs
- Colour-critical graphs and hypergraphs
- On the Broken-Circuit Complex of Graphs
- On the number of list‐colorings
- The Broken-Circuit Complex
- Graph colorings with local constraints -- a survey
- A logical expansion in mathematics
- Extremal Restraints for Graph Colourings
This page was built for publication: A broken cycle theorem for the restrained chromatic function