The following pages link to (Q4250147):
Displayed 22 items.
- A lower bound on the independence number of a graph in terms of degrees and local clique sizes (Q298956) (← links)
- A stronger bound for the strong chromatic index (extended abstract) (Q322242) (← links)
- Upper bounds on minimum balanced bipartitions (Q409437) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- The adaptable choosability number grows with the choosability number (Q641204) (← links)
- The chromatic and clique numbers of random scaled sector graphs (Q817771) (← links)
- An estimate for the probability of dependent events (Q956348) (← links)
- Asymptotically optimal frugal colouring (Q965250) (← links)
- A strengthening of Brooks' theorem (Q1306303) (← links)
- (\(\Delta-k\))-critical graphs (Q1767668) (← links)
- Asymptotically the list colouring constants are 1 (Q1850621) (← links)
- Additive non-approximability of chromatic number in proper minor-closed classes (Q2099409) (← links)
- Local boxicity (Q2122684) (← links)
- Rainbow factors in hypergraphs (Q2299634) (← links)
- Distributed coloring algorithms for triangle-free graphs (Q2347810) (← links)
- Bounded colorings of multipartite graphs and hypergraphs (Q2403698) (← links)
- Circumference, chromatic number and online coloring (Q2439828) (← links)
- An upper bound for the chromatic number of line graphs (Q2461774) (← links)
- Near-optimal list colorings (Q4521554) (← links)
- A Stronger Bound for the Strong Chromatic Index (Q4601050) (← links)
- Induced odd cycle packing number, independent sets, and chromatic number (Q6074594) (← links)
- Edge-colouring graphs with local list sizes (Q6187343) (← links)