Paths through K-specified edges in a linear graph

zbMATH Open0789.05082MaRDI QIDQ690196FDOQ690196

Authors: Harjeet Arora, Santosh Kumar 

Publication date: 12 June 1994

Published in: Opsearch (Search for Journal in Brave)

Recommendations

• Cycles and paths through specified vertices in k-connected graphs
• Paths and edge-connectivity in graphs
• Paths in graphs
• scientific article; zbMATH DE number 762736
• scientific article; zbMATH DE number 1151850
• Long paths and cycles through specified vertices in \(k\)-connected graphs.
• scientific article; zbMATH DE number 4099351
• Paths and trails in edge-colored graphs
• Paths and Trails in Edge-Colored Graphs
• Graphs of edge-intersecting and non-splitting paths

zbMATH Keywords

algorithmEulerian graphpathlinear graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)

Cited In (1)

• An algorithm to find all paths between two nodes in a graph

This page was built for publication: Paths through K-specified edges in a linear graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q690196)