3 citations · 3 across the 2 of their papers we have counts for
2 papers
math.CO2009★ 3 cited
Chromatic number and complete graph substructures for degree sequences
Zdenek Dvorak, Bojan Mohar
Given a graphic degree sequence , let (respectively , , and ) denote the maximum value of the chromatic number (respectively, the size of the largest cl…
math.MG2009
Simplices and spectra of graphs, continued
Bojan Mohar, Igor Rivin
In this note we show that the n-2-dimensional volumes of codimension 2 faces of an n-dimensional simplex are algebraically independent quantities of the volumes of its edge-lengths…