Oliver Schaudt, Vera Weil. Graphs in Which the Difference of the Maximum Clique Number and the Maximum Degree Is Bounded by a Constant. In Andreas Brieden, Zafer-Korcan Görgülü, Tino Krug, Erik Kropat, Silja Meyer-Nieberg, Goran Mihelcic, Stefan Wolfgang Pickl, editors, 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Munich, Germany, May 29-31, 2012. Extended Abstracts. pages 237-239, 2012.
@inproceedings{SchaudtW12,
title = {Graphs in Which the Difference of the Maximum Clique Number and the Maximum Degree Is Bounded by a Constant},
author = {Oliver Schaudt and Vera Weil},
year = {2012},
researchr = {https://researchr.org/publication/SchaudtW12},
cites = {0},
citedby = {0},
pages = {237-239},
booktitle = {11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Munich, Germany, May 29-31, 2012. Extended Abstracts},
editor = {Andreas Brieden and Zafer-Korcan Görgülü and Tino Krug and Erik Kropat and Silja Meyer-Nieberg and Goran Mihelcic and Stefan Wolfgang Pickl},
isbn = {978-3-943207-05-7},
}