Chemins Et Circuits Dans Les Graphes Orientes

DOI10.1016/S0167-5060(08)70891-4zbMath0453.05032OpenAlexW189857142MaRDI QIDQ3900093

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

Publication date: 1980

Published in: Combinatorics 79 Part I (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-5060(08)70891-4

zbMATH Keywords

digraphdirected pathdirected cycle

Mathematics Subject Classification ID

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

Related Items (12)

Extremal digraphs avoiding distinct walks of length 3 with the same endpoints ⋮ Bounds of the longest directed cycle length for minimal strong digraphs ⋮ On cycles and paths in digraphs ⋮ Cycles in strong oriented graphs ⋮ Longest paths in digraphs ⋮ Degrees and cycles in digraphs ⋮ Covering the vertices of a digraph by cycles of prescribed length ⋮ Hamiltonian paths and cycles, number of arcs and independence number in digraphs ⋮ Cycles in digraphs– a survey ⋮ About some cyclic properties in digraphs ⋮ Number of arcs and cycles in digraphs ⋮ Digraphs without directed path of length two or three

This page was built for publication: Chemins Et Circuits Dans Les Graphes Orientes