Über eine von H. S. WILF angegebene Schranke für die chromatische Zahl endlicher Graphen

DOI10.1002/mana.19690390415zbMath0172.25704OpenAlexW2066200594WikidataQ105944654 ScholiaQ105944654MaRDI QIDQ5560178

Hans-Joachim Finck, Horst Sachs

Publication date: 1969

Published in: Mathematische Nachrichten (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/mana.19690390415

zbMATH Keywords

topology

Related Items (6)

Bidegree of graph and degeneracy number ⋮ Parallel Maximum Clique Algorithms with Applications to Network Analysis ⋮ Efficient algorithms for decomposing graphs under degree constraints ⋮ Partitions of hypergraphs under variable degeneracy constraints ⋮ Vizing's coloring algorithm and the fan number ⋮ The game coloring number of planar graphs

Cites Work

• Unnamed Item

This page was built for publication: Über eine von H. S. WILF angegebene Schranke für die chromatische Zahl endlicher Graphen