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

scientific article

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

zbMath0981.05056MaRDI QIDQ2741466

Vlady Ravelomanana, Loÿs Thimonier

Publication date: 24 October 2001


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

generating functionsasymptotic estimatescographsparse trees


Mathematics Subject Classification ID

Enumeration in graph theory (05C30)


Related Items

Grammars and clique-width bounds from split decompositions ⋮ Graphon convergence of random cographs ⋮ Cograph generation with linear delay ⋮ Enumerations, forbidden subgraph characterizations, and the split-decomposition



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Complement reducible graphs
  • Enumerative aspects of certain subclasses of perfect graphs
  • A calculus for the random generation of labelled combinatorial structures
  • The number of trees
  • A Linear Recognition Algorithm for Cographs
  • Asymptotic Methods in Enumeration
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2741466&oldid=15605904"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 15:22.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki