Pages that link to "Item:Q1252865"
From MaRDI portal
The following pages link to Chromatic number, girth and maximal degree (Q1252865):
Displaying 19 items.
- Symmetry breaking depending on the chromatic number or the neighborhood growth (Q392191) (← links)
- Directed acyclic graphs with the unique dipath property (Q393144) (← links)
- Two results on the digraph chromatic number (Q418896) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- The edge density of critical digraphs (Q519953) (← links)
- Degree sequences of random graphs (Q1146197) (← links)
- Coloring graphs with sparse neighborhoods (Q1569053) (← links)
- Distributed coloring algorithms for triangle-free graphs (Q2347810) (← links)
- Large induced forests in sparse graphs (Q2781059) (← links)
- An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model (Q4620411) (← links)
- On Brooks' Theorem for Sparse Graphs (Q4852428) (← links)
- Dominator and total dominator coloring of circulant graph <i>C<sub>n</sub></i>(1, 2) (Q5059595) (← links)
- Digraphs and Variable Degeneracy (Q5062115) (← links)
- Extremal problems in hypergraph colourings (Q5112450) (← links)
- Component Games on Regular Graphs (Q5414147) (← links)
- Improved distributed algorithms for coloring interval graphs with application to multicoloring trees (Q5919420) (← links)
- (Q6084349) (← links)
- On triangle-free list assignments (Q6184549) (← links)
- Subdivisions in dicritical digraphs with large order or digirth (Q6612301) (← links)
