A broken cycle theorem for the restrained chromatic function

DOI10.3906/MAT-1807-200MaRDI QIDQ5742940zbMATH OpenOpenAlexWikidataFDO

Authors Aysel Erey

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

zbMATH Keywords

\(x\)-coloringchromatic polynomialrestrained chromatic functionrestraint

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Enumeration in graph theory (05C30) Graph polynomials (05C31) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Extremal restraints for graph colourings
• Restraints permitting the largest number of colourings
• A note on a broken-cycle theorem for hypergraphs
• Graph coloring satisfying restraints
• Recursion relations for chromatic coefficients for graphs and hypergraphs

Cites work

• \( h\)-vectors of matroids and logarithmic concavity
• A logical expansion in mathematics
• A note on a broken-cycle theorem for hypergraphs
• An abstraction of Whitney's broken circuit theorem
• Broken circuit complexes: Factorizations and generalizations
• Colour-critical graphs and hypergraphs
• Extremal restraints for graph colourings
• Graph colorings with local constraints -- a survey
• scientific article; zbMATH DE number 446487 (Why is no real title available?)
• scientific article; zbMATH DE number 2038883 (Why is no real title available?)
• Interval vertex-coloring of a graph with forbidden colors
• Möbius functions of lattices
• On the broken-circuit complex of graphs
• On the NBC-complexes and \(\beta \)-invariants of abstract convex geometries
• On the number of list‐colorings
• Restraints permitting the largest number of colourings
• Several identities for the characteristic polynomial of a combinatorial geometry
• The Broken-Circuit Complex
• The chromatic polynomial and list colorings
• When does the list-coloring function of a graph equal its chromatic polynomial

Cited in

(3)

• Restraints permitting the largest number of colourings
• Extremal restraints for graph colourings
• Counting subgraphs of coloring graphs

This page was built for publication: A broken cycle theorem for the restrained chromatic function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5742940)