Digraphs with the path‐merging property

DOI10.1002/jgt.3190200214zbMath0832.05047OpenAlexW2158682982MaRDI QIDQ4852410

Jörgen Bang-Jensen

Publication date: 20 February 1996

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190200214

zbMATH Keywords

pathsdigraphtournamentshamiltonian cyclepath-mergeable

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (12)

\( \chi \)-diperfect digraphs ⋮ Cycles of all lengths in arc-3-cyclic semicomplete digraphs ⋮ Good orientations of unions of edge‐disjoint spanning trees ⋮ Independent sets and non-augmentable paths in generalizations of tournaments ⋮ Berge's conjecture and Aharoni-Hartman-Hoffman's conjecture for locally in-semicomplete digraphs ⋮ Spanning acyclic subdigraphs and strong \(t\)-panconnectivity of tournaments ⋮ Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs ⋮ Locally Semicomplete Digraphs and Generalizations ⋮ Quasi-Transitive Digraphs and Their Extensions ⋮ Miscellaneous Digraph Classes ⋮ Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs ⋮ \(\alpha\)-diperfect digraphs

Cites Work

• On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Digraphs with the path‐merging property