19 citations · 30 across the 14 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
math.CO2020★ 1 cited
Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties
J. Bang-Jensen, F. Havet, M. Kriesell +1
Generalizing well-known results of Erdős and Lovász, we show that every graph contains a spanning -partite subgraph with , wher…
math.CO2020
Rooted Minors and Locally Spanning Subgraphs
Thomas Böhme, Jochen Harant, Matthias Kriesell +2
Results on the existence of various types of spanning subgraphs of graphs are milestones in structural graph theory and have been diversified in several directions. In the present…
math.CO2020
A note on uniquely 10-colorable graphs
Matthias Kriesell
We prove for k at most 10, that every graph of chromatic number k with a unique k-coloring admits a clique minor of order k.