Brooks' Theorem and Beyond (Q3466339)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Brooks' Theorem and Beyond	scientific article

Statements

scholarly article

0 references

Brooks' Theorem and Beyond (English)

0 references

zbMATH Open document ID

0 references

10.1002/jgt.21847

0 references

Daniel W. Cranston

0 references

0 references

Journal of Graph Theory

0 references

publication date

1 February 2016

0 references

full work available at URL

https://arxiv.org/abs/1403.0479

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

zbMATH Keywords

Brooks theorem

0 references

graph coloring

0 references

list coloring

0 references

Kempe chains

0 references

hitting sets

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

0 references

0 references

Colorings and orientations of graphs

0 references

Spanning trees with pairwise nonadjacent endvertices

0 references

Optimal Vertex Partitions

0 references

Short proofs of classical theorems

0 references

0 references

On an upper bound of the graph's chromatic number, depending on the graph's degree and density

0 references

Variable degeneracy: Extensions of Brooks' and Gallai's theorems

0 references

A characterisation of some 2-connected graphs and a comment on an algorithmic proof of Brooks' theorem

0 references

Three topics in online list coloring

0 references

Another bound on the chromatic number of a graph

0 references

Brooks' graph-coloring theorem and the independence number

0 references

Hajos' graph-coloring conjecture: Variations and counterexamples

0 references

Coloring Claw-Free Graphs with $\Delta-1$ Colors

0 references

0 references

A Theorem of R. L. Brooks and a Conjecture of H. Hadwiger

0 references

Graphs in which every finite path is contained in a circuit

0 references

Subcubic triangle-free graphs have fractional chromatic number at most 14/5

0 references

Bounding the Fractional Chromatic Number of $K_\Delta$-Free Graphs

0 references

Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth

0 references

Brooks' theorem via the Alon-Tarsi theorem

0 references

Hitting all maximum cliques with a stable set using lopsided independent transversals

0 references

A Fractional Analogue of Brooks' Theorem

0 references

0 references

Lower bound of the Hadwiger number of graphs by their average degree

0 references

On equitable \(\Delta\)-coloring of graphs with low average degree

0 references

The colour theorems of Brooks and Gallai extended

0 references

0 references

Three short proofs in graph theory

0 references

New proof of brooks' theorem

0 references

A short proof of Catlin's extension of Brooks' theorem

0 references

Colouring graphs when the number of colours is nearly the maximum degree

0 references

Graph colouring and the probabilistic method

0 references

A new proof of Brooks's chromatic number theorem for graphs

0 references

A different short proof of Brooks' theorem

0 references

On hitting all maximum cliques with an independent set

0 references

0 references

A strengthening of Brooks' theorem

0 references

A paintability version of the combinatorial Nullstellensatz, and list colorings of \(k\)-partite \(k\)-uniform hypergraphs

0 references

Flexible color lists in Alon and Tarsi's theorem, and time scheduling with unreliable participants

0 references

The Effective Version of Brooks' Theorem

0 references

A unified proof of Brooks' theorem and Catlin's theorem

0 references

The forest plus stars colouring problem

0 references

On Brooks' theorem and some related results.

0 references

On Schmerl's effective version of Brooks' theorem

0 references

On-line list colouring of graphs

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3466339

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3466339&oldid=36226689"