The following pages link to Universal and unavoidable graphs (Q5886120):
Displaying 12 items.
- Graph cores via universal completability (Q322258) (← links)
- Almost all cop-win graphs contain a universal vertex (Q418869) (← links)
- Universal graphs with a forbidden subtree (Q875935) (← links)
- On universal graphs with forbidden topological subgraphs (Q1068096) (← links)
- Feasible graphs with standard universe (Q1295403) (← links)
- Universally signable graphs (Q1375057) (← links)
- Unavoidable hypergraphs (Q1984522) (← links)
- Universal geometric graphs (Q2110618) (← links)
- (Q3496356) (← links)
- Some remarks on universal graphs (Q5906404) (← links)
- Graph Traversals as Universal Constructions (Q6168427) (← links)
- A note on universal graphs for spanning trees (Q6657271) (← links)