Pages that link to "Item:Q1124608"
From MaRDI portal
The following pages link to Spanning Eulerian subgraphs and matchings (Q1124608):
Displaying 14 items.
- Collapsible graphs and Hamilton cycles of line graphs (Q494432) (← links)
- Spanning closed trails in graphs (Q686147) (← links)
- Contractions of graphs with no spanning Eulerian subgraphs (Q1112064) (← links)
- Graphs without spanning closed trails (Q1126285) (← links)
- Spanning eulerian subgraphs, the splitting lemma, and Petersen's theorem (Q1197011) (← links)
- Duality in graph families (Q1208357) (← links)
- On dominating and spanning circuits in graphs (Q1313841) (← links)
- Supereulerian graphs, independent sets, and degree-sum conditions (Q1377709) (← links)
- A note on minimum degree conditions for supereulerian graphs (Q1613362) (← links)
- Spanning Eulerian subgraphs of large size (Q1733865) (← links)
- A reduction method to find spanning Eulerian subgraphs (Q3808126) (← links)
- Collapsible graphs and matchings (Q4271616) (← links)
- (Q5740779) (← links)
- Spanning closed trail and hamiltonian cycle in grid graphs (Q6487981) (← links)