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

On the number of paths and cycles for almost all graphs and digraphs

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

DOI10.1007/BF02579411zbMath0594.05038OpenAlexW2037787729MaRDI QIDQ1076688

Ioan Tomescu

Publication date: 1986

Published in: Combinatorica (Search for Journal in Brave)

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


zbMATH Keywords

enumerationgraphsdigraphss-cycless-paths


Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)


Related Items (1)

Negative cycles in complete signed graphs




Cites Work

  • On the number of certain Hamilton circuits of a complete graph
  • Unnamed Item




This page was built for publication: On the number of paths and cycles for almost all graphs and digraphs

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