On the number of precolouring extensions

DOI10.1006/EUJC.1999.0411zbMath0968.05031OpenAlexW2054552471MaRDI QIDQ1590211

Klaus Dohmen

Publication date: 19 December 2000

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/a52224a33364c913b1109ce7159f6a1ee4112f15

zbMATH Keywords

hypergraphcolouringinclusion-exclusion principleprecolouringWhitney's broken circuit theorem

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Precoloring extension. I: Interval graphs
• An improvement of the inclusion-exclusion principle
• A broken-circuits-theorem for hypergraphs
• Precoloring Extension III: Classes of Perfect Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the number of precolouring extensions