Longest paths in digraphs

DOI10.1007/BF02579454MaRDI QIDQ1165864zbMATH OpenOpenAlexFDO

Authors Jean-Claude Bermond, Anne Germa, Marie-Claude Heydemann, D. Sotteau

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

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

Cites work

• scientific article; zbMATH DE number 3613081 (Why is no real title available?)
• Chemins Et Circuits Dans Les Graphes Orientes
• Cycles in digraphs– a survey
• Flots et tensions dans un graphe
• Long paths and cycles in oriented graphs
• On cycles and paths in digraphs
• Sur les arborescences dans un graphe oriente

Cited in

(7)

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

This page was built for publication: Longest paths in digraphs

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