Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Back to Simple Search

Advanced Search

Match of the following rules

Add Another Rule

Contains the following math formula (red border means the formula is incomplete)

Formula preview

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Currently displaying 1 – 3 of 3

Order by Relevance | Title | Year of publication

The Borodin-Kostochka conjecture for graphs containing a doubly critical edge.

Rabern, Landon — 2007

The Electronic Journal of Combinatorics [electronic only]

A strengthening of Brooks' Theorem for line graphs.

Rabern, Landon — 2011

The Electronic Journal of Combinatorics [electronic only]

A Different Short Proof of Brooks’ Theorem

Landon Rabern — 2014

Discussiones Mathematicae Graph Theory

Lovász gave a short proof of Brooks’ theorem by coloring greedily in a good order. We give a different short proof by reducing to the cubic case.

Page 1

Download Results (CSV)