The following pages link to (Q4065587):
Displaying 11 items.
- Undirected distances and the postman-structure of graphs (Q1099186) (← links)
- The two ear theorem on matching-covered graphs (Q1127879) (← links)
- On n-extendable graphs (Q1143417) (← links)
- Matchings in regular graphs (Q1155070) (← links)
- Matching theory -- a sampler: From Dénes König to the present (Q1198643) (← links)
- On minimal elementary bipartite graphs (Q1245978) (← links)
- \(k\)-cycle resonant graphs (Q1343255) (← links)
- Planar \(k\)-cycle resonant graphs with \(k=1,2\) (Q1406034) (← links)
- Reducible chains of planar 1-cycle resonant graphs (Q1420593) (← links)
- Construction for bicritical graphs and \(k\)-extendable bipartite graphs (Q2497479) (← links)
- Minimum degree of minimal \((n-10)\)-factor-critical graphs (Q6197704) (← links)
