Heavy paths and cycles in weighted graphs
From MaRDI portal
Publication:1587616
DOI10.1016/S0012-365X(99)00413-6zbMATH Open0967.05040WikidataQ127344086 ScholiaQ127344086MaRDI QIDQ1587616FDOQ1587616
Xueliang Li, Hajo Broersma, Shenggui Zhang
Publication date: 27 August 2001
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)
Cited In (21)
- On vertex-induced weighted Turán problems
- On extremal weighted digraphs with no heavy paths
- Heavy subgraph conditions for longest cycles to be heavy in graphs
- Note on weights of paths in polyhedral graphs
- Cycle connectivity in weighted graphs
- Heavy fans, cycles and paths in weighted graphs of large connectivity
- Monophonic convexity in weighted graphs
- Title not available (Why is that?)
- A characterization of partial blocks in weighted graphs
- Ore-type degree condition for heavy paths in weighted graphs
- A generalization of Menger's theorem
- Connectivity analysis and construction of cyclically balanced graphs
- Lightweight paths in graphs
- Heavy cycles in weighted graphs
- Heavy cycles in weighted graphs
- Hitting Weighted Even Cycles in Planar Graphs
- Unbalanced spanning subgraphs in edge labeled complete graphs
- Weighted degrees and heavy cycles in weighted graphs
- Title not available (Why is that?)
- On the weights of simple paths in weighted complete graphs
- Arc analysis algorithm (AAA) for arc-weighted graphs
This page was built for publication: Heavy paths and cycles in weighted graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1587616)