Longest paths in digraphs

DOI10.1007/BF02579454zbMath0488.05039OpenAlexW2083329054MaRDI QIDQ1165864

Jean-Claude Bermond, Marie-Claude Heydemann, Dominique Sotteau, Anne Germa

Publication date: 1981

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579454

zbMATH Keywords

indegreeoutdegreeconnected digraph

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20)

Related Items (6)

Ramsey-type results for path covers and path partitions. II: Digraphs ⋮ On cycles and paths in digraphs ⋮ Degrees and cycles in digraphs ⋮ Subtrees of bipartite digraphs---the minimum degree condition ⋮ Non-euclidean geometry, continued fractions, and ergodic theory ⋮ On degree sum conditions for directed path-factors with a specified number of paths

Cites Work

• On cycles and paths in digraphs
• Sur les arborescences dans un graphe oriente
• Chemins Et Circuits Dans Les Graphes Orientes
• Cycles in digraphs– a survey
• Long paths and cycles in oriented graphs
• Flots et tensions dans un graphe
• Unnamed Item

This page was built for publication: Longest paths in digraphs