Pages that link to "Item:Q1229732"
From MaRDI portal
The following pages link to On an upper bound of the graph's chromatic number, depending on the graph's degree and density (Q1229732):
Displaying 50 items.
- On cylindrical graph construction and its applications (Q252833) (← links)
- The \(m\)-degenerate chromatic number of a digraph (Q267198) (← links)
- On 1-improper 2-coloring of sparse graphs (Q393935) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- Colouring graphs when the number of colours is almost the maximum degree (Q462929) (← links)
- Coloring a graph with \(\Delta-1\) colors: conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker (Q472396) (← links)
- On a theorem about vertex colorings of graphs (Q579272) (← links)
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- Unfriendly partitions of a graph (Q753841) (← links)
- Satisfactory graph partition, variants, and generalizations (Q976309) (← links)
- Partitioning a graph into alliance free sets (Q1025928) (← links)
- Improvement on Brooks' chromatic bound for a class of graphs (Q1168976) (← links)
- A note on the independence number of triangle-free graphs. II (Q1186139) (← links)
- Another bound on the chromatic number of a graph (Q1248527) (← links)
- Chromatic number, girth and maximal degree (Q1252865) (← links)
- A strengthening of Brooks' theorem (Q1306303) (← links)
- Judicious partitions of graphs (Q1314903) (← links)
- Ramsey-nice families of graphs (Q1645058) (← links)
- Partitions of multigraphs under minimum degree constraints (Q1730245) (← links)
- Minimal orientations of colour critical graphs (Q1894707) (← 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)
- New potential functions for greedy independence and coloring (Q2255044) (← links)
- A note on coloring vertex-transitive graphs (Q2341047) (← links)
- Distributed coloring algorithms for triangle-free graphs (Q2347810) (← links)
- Chromatic properties of the Pancake graphs (Q2364095) (← links)
- Painting squares in \(\Delta^2-1\) shades (Q2629492) (← links)
- On a conjecture of Schweser and Stiebitz (Q2661211) (← links)
- New upper bounds for the chromatic number of a graph (Q2707978) (← links)
- Coloring sparse hypergraphs (Q2813339) (← links)
- Graphs with $\chi=\Delta$ Have Big Cliques (Q2949718) (← links)
- On the Grundy Number of a Graph (Q3058701) (← links)
- Alliances and Related Domination Parameters (Q3384109) (← links)
- Self-Stabilizing Domination Algorithms (Q3384122) (← links)
- Brooks' Theorem and Beyond (Q3466339) (← links)
- Problems and results on judicious partitions (Q4798176) (← links)
- On Brooks' Theorem for Sparse Graphs (Q4852428) (← links)
- Destroying Noncomplete Regular Components in Graph Partitions (Q4908827) (← links)
- Vertex partition of hypergraphs and maximum degenerate subhypergraphs (Q4958039) (← links)
- Brooks' theorem for 2-fold coloring (Q5061398) (← links)
- A Note on Hitting Maximum and Maximal Cliques With a Stable Set (Q5325947) (← links)
- List-Coloring Claw-Free Graphs with $\Delta-1$ Colors (Q5346550) (← links)
- SELF-STABILIZING ALGORITHMS FOR UNFRIENDLY PARTITIONS INTO TWO DISJOINT DOMINATING SETS (Q5408358) (← 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)
- A note on Reed's conjecture for triangle-free graphs (Q6080563) (← links)
- The Fractional Chromatic Number of \(\boldsymbol{K_{\Delta }}\)-Free Graphs (Q6081802) (← links)
