Pages that link to "Item:Q1099186"
From MaRDI portal
The following pages link to Undirected distances and the postman-structure of graphs (Q1099186):
Displaying 12 items.
- A characterization of minimal non-Seymour graphs (Q898107) (← links)
- Tight integral duality gap in the Chinese postman problem (Q1196167) (← links)
- On shortest \(T\)-joins and packing \(T\)-cuts (Q1210583) (← links)
- Vertex set partitions preserving conservativeness (Q1850496) (← links)
- Graft analogue of general Kotzig-Lovász decomposition (Q2081503) (← links)
- Conservative weightings and ear-decompositions of graphs (Q2367443) (← links)
- An Excluded Minor Characterization of Seymour Graphs (Q3009746) (← links)
- Circuit decompositions of join-covered graphs (Q3652553) (← links)
- Packing $k$-Matchings and $k$-Critical Graphs (Q4602858) (← links)
- A characterization of Seymour graphs (Q5101429) (← links)
- Algorithms for Weighted Matching Generalizations II: <i>f</i>-factors and the Special Case of Shortest Paths (Q5858647) (← links)
- Complexity of finding a join of maximum weight (Q5954077) (← links)
