DOOR_Capabilities SBrandt_26Feb15
On a conjecture about edge irregular total labelings
9-Connected Claw-Free Graphs Are Hamilton-Connected
Minimum degree and density of binary sequences
A 4-colour problem for dense triangle-free graphs
A sufficient condition for all short cycles
Triangle-free graphs and forbidden subgraphs
Global Connectivity And Expansion: Long Cycles and Factors In f-Connected Graphs
We Want To Be Your Partner