Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On cycles and paths in digraphs

From MaRDI portal
Publication:1143411
Jump to:navigation, search

DOI10.1016/0012-365X(80)90039-4zbMath0442.05040MaRDI QIDQ1143411

Marie-Claude Heydemann

Publication date: 1980

Published in: Discrete Mathematics (Search for Journal in Brave)


zbMATH Keywords

pathscyclesdigraphs


Mathematics Subject Classification ID

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


Related Items (5)

A sufficient condition for oriented graphs to be Hamiltonian ⋮ Extremal digraphs avoiding distinct walks of length 3 with the same endpoints ⋮ Cycles in strong oriented graphs ⋮ Longest paths in digraphs ⋮ Degrees and cycles in digraphs




Cites Work

  • Longest paths in digraphs
  • Chemins Et Circuits Dans Les Graphes Orientes




This page was built for publication: On cycles and paths in digraphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1143411&oldid=13197675"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 04:03.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki