A Note on a Broken-Cycle Theorem for Hypergraphs

Whitney’s Broken-cycle Theorem states the chromatic polynomial of a graph as a sum over special edge subsets. We give a definition of cycles in hypergraphs that preserves the statement of the theorem there

Detalles Bibliográficos
Autor principal: Trinks Martin
Formato: Artículo
Lenguaje:English
Publicado: University of Zielona Góra 2014-08-01
Colección:Discussiones Mathematicae Graph Theory
Materias:
Acceso en línea:https://doi.org/10.7151/dmgt.1734