Pages that link to "Item:Q1916109"
From MaRDI portal
The following pages link to Applications of hypergraph coloring to coloring graphs not inducing certain trees (Q1916109):
Displaying 12 items.
- Induced cycles and chromatic number (Q1306304) (← links)
- Classes of graphs that exclude a tree and a clique and are not vertex Ramsey (Q1375696) (← links)
- Induced subgraphs of graphs with large chromatic number. XI. Orientations (Q1633601) (← links)
- Vertex Ramsey properties of families of graphs (Q1850588) (← links)
- Induced subgraphs of graphs with large chromatic number. XIII. New brooms (Q2011144) (← links)
- Extension of Gyárfás-Sumner conjecture to digraphs (Q2030749) (← links)
- From \(\chi\)- to \(\chi_p\)-bounded classes (Q2099414) (← links)
- Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree (Q6046682) (← links)
- A note on the Gyárfás-Sumner conjecture (Q6121918) (← links)
- Polynomial bounds for chromatic number. V: Excluding a tree of radius two and a complete multipartite graph (Q6144408) (← links)
- On perfect balanced rainbow-free colorings and complete colorings of projective spaces (Q6601139) (← links)
- Polynomial bounds for chromatic number. VIII: Excluding a path and a complete multipartite graph (Q6642504) (← links)
