Pages that link to "Item:Q1306303"
From MaRDI portal
The following pages link to A strengthening of Brooks' theorem (Q1306303):
Displaying 44 items.
- Coloring a graph with \(\Delta-1\) colors: conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker (Q472396) (← links)
- A unified proof of Brooks' theorem and Catlin's theorem (Q472980) (← links)
- A strengthening of Brooks' Theorem for line graphs (Q553999) (← links)
- The distance coloring of graphs (Q741239) (← links)
- Asymptotically optimal frugal colouring (Q965250) (← links)
- An NC algorithm for Brooks' theorem (Q1124351) (← links)
- Ramsey-nice families of graphs (Q1645058) (← links)
- (\(\Delta-k\))-critical graphs (Q1767668) (← links)
- On the connection between chromatic number, maximal clique and minimal degree of a graph (Q1844683) (← links)
- On the Grundy and \(b\)-chromatic numbers of a graph (Q1949739) (← links)
- Borodin-Kostochka's conjecture on \((P_5,C_4)\)-free graphs (Q2053188) (← links)
- Bounded \(VC\)-dimension implies the Schur-Erdős conjecture (Q2064760) (← links)
- Chromatic numbers of layered graphs with a bounded maximal clique (Q2256701) (← links)
- Dynamic proper colorings of a graph (Q2256703) (← links)
- A note on coloring vertex-transitive graphs (Q2341047) (← links)
- Convex hull of face vectors of colored complexes (Q2441631) (← links)
- Joints in graphs (Q2463464) (← links)
- A reconfigurations analogue of Brooks' theorem and its consequences (Q2833252) (← links)
- Graphs with $\chi=\Delta$ Have Big Cliques (Q2949718) (← links)
- On the Grundy Number of a Graph (Q3058701) (← links)
- A strengthening of the Assmus-Mattson theorem (Q3363239) (← links)
- Brooks' Theorem and Beyond (Q3466339) (← links)
- (Q4027183) (← links)
- On graphs with linear Ramsey numbers (Q4521487) (← links)
- List-Coloring Claw-Free Graphs with $\Delta-1$ Colors (Q5346550) (← links)
- Algorithmic bounds for the chromatic number† (Q5449019) (← links)
- Coloring Graphs with Dense Neighborhoods (Q5495890) (← links)
- Odd-sum colorings of graphs (Q5883509) (← links)
- Coloring (P5,gem) $({P}_{5},\text{gem})$‐free graphs with Δ−1 ${\rm{\Delta }}-1$ colors (Q6046645) (← links)
- Combinatorics. Abstracts from the workshop held January 1--7, 2023 (Q6052106) (← links)
- A note on \(\Delta\)-critical graphs (Q6063276) (← links)
- The Fractional Chromatic Number of \(\boldsymbol{K_{\Delta }}\)-Free Graphs (Q6081802) (← links)
- Large cliques in graphs with high chromatic number (Q6091811) (← links)
- The list version of the Borodin-Kostochka conjecture for graphs with large maximum degree (Q6091818) (← links)
- Special issue in honour of Landon Rabern (Q6091821) (← links)
- Coloring \(\{ P 2 \cup P 3 , \operatorname{house} \} \)-free graphs with \(\Delta - 1\) colors (Q6143841) (← links)
- Strengthening Brooks' chromatic bound on \(P_6\)-free graphs (Q6143873) (← links)
- Borodin-Kostochka conjecture holds for odd-hole-free graphs (Q6154380) (← links)
- Coloring hammer-free graphs with \(\Delta - 1\) colors (Q6177425) (← links)
- Partitioning of a graph into induced subgraphs not containing prescribed cliques (Q6180565) (← links)
- Bounds and monotonicity of critical set parameters of colourings (Q6542052) (← links)
- Brooks' theorem in graph streams: a single-pass semi-streaming algorithm for \(\Delta\)-coloring (Q6566595) (← links)
- Fractional coloring with local demands and applications to degree-sequence bounds on the independence number (Q6615757) (← links)
- Borodin-Kostochka's conjecture on \(\{P_2 \cup P_3, C_4\}\)-free graphs (Q6650716) (← links)
