The following pages link to (Q4401977):
Displayed 13 items.
- Efficient sets in partial \(k\)-trees (Q686252) (← links)
- On Ringeisen's isolation game. II (Q804481) (← links)
- Regular separable graphs of minimum order with given diameter (Q1148920) (← links)
- Balanced graphs and noncovering graphs (Q1176731) (← links)
- Graphs with small diameter after edge deletion (Q1199416) (← links)
- The isolation game for regular graphs (Q1210561) (← links)
- Maximum genus and girth of graphs (Q1297489) (← links)
- Intersecting designs from linear programming and graphs of diameter two (Q1322228) (← links)
- On minimizing the largest eigenvalue of a symmetric matrix (Q1345514) (← links)
- Cycles in Hamiltonian graphs of prescribed maximum degree (Q1810655) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)
- A note on pancyclism of highly connected graphs (Q1883250) (← links)
- On the structure of the set of cycle lengths in a Hamiltonian graph (Q1883261) (← links)