scientific article; zbMATH DE number 1303525
From MaRDI portal
Publication:4250147
Recommendations
Cited in
(27)- Local boxicity
- An estimate for the probability of dependent events
- Randomly colouring graphs (a combinatorial view)
- A lower bound on the independence number of a graph in terms of degrees and local clique sizes
- Distributed coloring algorithms for triangle-free graphs
- Near-optimal list colorings
- Probabilistic methods in coloring and decomposition problems
- An exact method for graph coloring
- A stronger bound for the strong chromatic index
- Asymptotically optimal frugal colouring
- Rainbow factors in hypergraphs
- The adaptable choosability number grows with the choosability number
- Upper bounds on minimum balanced bipartitions
- scientific article; zbMATH DE number 5237271 (Why is no real title available?)
- The chromatic and clique numbers of random scaled sector graphs
- Asymptotically the list colouring constants are 1
- (\(\Delta-k\))-critical graphs
- A strengthening of Brooks' theorem
- A stronger bound for the strong chromatic index (extended abstract)
- An upper bound for the chromatic number of line graphs
- Induced odd cycle packing number, independent sets, and chromatic number
- Additive non-approximability of chromatic number in proper minor-closed classes
- An introduction to the discharging method via graph coloring
- Graph colouring and the probabilistic method
- Circumference, chromatic number and online coloring
- Edge-colouring graphs with local list sizes
- Bounded colorings of multipartite graphs and hypergraphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4250147)
