Pages that link to "Item:Q3703676"
From MaRDI portal
The following pages link to On finding spanning eulerian subgraphs (Q3703676):
Displaying 18 items.
- A cubic algorithm for the directed Eulerian subgraph problem (Q806684) (← links)
- Minimum-maximal matching in series-parallel graphs (Q1099085) (← links)
- Permutation graphs: Connected domination and Steiner trees (Q1174135) (← links)
- Algorithms for recognition of regular properties and decomposition of recursive graph families (Q1179734) (← links)
- Spanning eulerian subgraphs, the splitting lemma, and Petersen's theorem (Q1197011) (← links)
- Minimum perfect bipartite matchings and spanning trees under categorization (Q1201102) (← links)
- Weighted connected domination and Steiner trees in distance-hereditary graphs (Q1270785) (← links)
- On minimum cuts and the linear arrangement problem (Q1570828) (← links)
- Spanning Eulerian subgraphs of large size (Q1733865) (← links)
- The NP-completeness of finding A-trails in Eulerian graphs and of finding spanning trees in hypergraphs (Q1893154) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- A note on the undirected rural postman problem polytope (Q2492671) (← links)
- On computing the Hamiltonian index of graphs (Q2699968) (← links)
- (Q4190662) (← links)
- (Q4679686) (← links)
- On Computing the Hamiltonian Index of Graphs (Q5042256) (← links)
- (Q5740779) (← links)
- Long Circuits and Large Euler Subgraphs (Q5891185) (← links)