Pages that link to "Item:Q462929"
From MaRDI portal
The following pages link to Colouring graphs when the number of colours is almost the maximum degree (Q462929):
Displaying 19 items.
- Ramsey-nice families of graphs (Q1645058) (← links)
- Distant set distinguishing edge colourings of graphs (Q1686263) (← links)
- Colouring generalized claw-free graphs and graphs of large girth: bounding the diameter (Q2167905) (← links)
- New algorithm for calculating chromatic index of graphs and its applications (Q2338156) (← links)
- Open Problems on Graph Coloring for Special Graph Classes (Q2827799) (← links)
- (Q5090456) (← links)
- Colouring H-free graphs of bounded diameter. (Q5092372) (← links)
- Distant sum distinguishing index of graphs with bounded minimum degree (Q5217057) (← links)
- ON GRAPH FOLDING AND MOBILE RADIO FREQUENCY ASSIGNMENT (Q5220284) (← links)
- A local epsilon version of Reed's conjecture (Q5919302) (← links)
- Adaptable and conflict colouring multigraphs with no cycles of length three or four (Q6047975) (← links)
- On the inclusion chromatic index of a graph (Q6055925) (← links)
- When removing an independent set is optimal for reducing the chromatic number (Q6057453) (← links)
- Conflict‐free chromatic number versus conflict‐free chromatic index (Q6057644) (← links)
- A note on \(\Delta\)-critical graphs (Q6063276) (← links)
- Colorings, transversals, and local sparsity (Q6074708) (← links)
- Asymptotically good edge correspondence colourings (Q6081556) (← links)
- Distributed algorithms, the Lovász local lemma, and descriptive combinatorics (Q6107878) (← links)
- Hardness transitions and uniqueness of acyclic colouring (Q6145810) (← links)
