Pages that link to "Item:Q3989737"
From MaRDI portal
The following pages link to The strong chromatic number of a graph (Q3989737):
Displaying 30 items.
- The sigma chromatic number of a graph (Q607685) (← links)
- Fractional total colourings of graphs of high girth (Q651031) (← links)
- Uniform coloring of graph (Q744551) (← links)
- Some results on \((a:b)\)-choosability (Q1025484) (← links)
- The strong chromatic number of partial triple systems (Q1101122) (← links)
- Probabilistic methods in coloring and decomposition problems (Q1322212) (← links)
- Covering with Latin transversals (Q1345959) (← links)
- Semi-strong chromatic number of a graph (Q1346444) (← links)
- Independent transversals in \(r\)-partite graphs (Q1377695) (← links)
- Problems and results in extremal combinatorics. I. (Q1417566) (← links)
- Coloring graphs with sparse neighborhoods (Q1569053) (← links)
- On monochromatic component size for improper colourings (Q1775062) (← links)
- 2-factors in dense graphs (Q1917480) (← links)
- Chromatic numbers of layered graphs with a bounded maximal clique (Q2256701) (← links)
- Independent transversals in locally sparse graphs (Q2384801) (← links)
- On factors of independent transversals in \(k\)-partite graphs (Q2665964) (← links)
- An average degree condition for independent transversals (Q2668023) (← links)
- A problem for strong vertex colouring of graphs (Q2743105) (← links)
- Bounded transversals in multipartite graphs (Q2897209) (← links)
- New<i>i</i>-Perfect Cycle Decompositions via Vertex Colorings of Graphs (Q2957063) (← links)
- (Q3445389) (← links)
- An algorithmic approach to the Lovász local lemma. I (Q3986105) (← links)
- A parallel algorithmic version of the local lemma (Q3986106) (← links)
- Choice Numbers of Graphs: a Probabilistic Approach (Q4291205) (← links)
- Near-optimal list colorings (Q4521554) (← links)
- Maximal antiramsey graphs and the strong chromatic number (Q4731212) (← links)
- On graphs with strongly independent color-classes (Q4736765) (← links)
- A Note on Degenerate and Spectrally Degenerate Graphs (Q4908820) (← links)
- An asymptotic bound for the strong chromatic number (Q5222554) (← links)
- On finding constrained independent sets in cycles (Q6130317) (← links)
