The following pages link to Coloring, sparseness and girth (Q312271):
Displaying 11 items.
- High girth augmented trees are huge (Q739384) (← links)
- Graphs vertex-partitionable into strong cliques (Q1709542) (← links)
- Circular chromatic number of signed graphs (Q2034071) (← links)
- High girth hypergraphs with unavoidable monochromatic or rainbow edges (Q2118239) (← links)
- Generalized signed graphs of large girth and large chromatic number (Q2144578) (← links)
- Uniquely \(D\)-colourable digraphs with large girth. II: Simplification via generalization (Q2656903) (← links)
- List Coloring with a Bounded Palette (Q2958200) (← links)
- Separation Choosability and Dense Bipartite Induced Subgraphs (Q5222550) (← links)
- Girth and λ $\lambda $‐choosability of graphs (Q6074593) (← links)
- Graphs of large chromatic number (Q6198641) (← links)
- Graphs with large girth and chromatic number are hard for Nullstellensatz (Q6573006) (← links)
