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

Patchworks and metablocks enumeration

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

DOI10.1016/S0020-0190(00)00015-6zbMath1014.68113WikidataQ126843639 ScholiaQ126843639MaRDI QIDQ1607027

Loÿs Thimonier, Vlady Ravelomanana

Publication date: 25 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)


zbMATH Keywords

cutpoint of a graph


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30)




Cites Work

  • Unnamed Item
  • A calculus for the random generation of labelled combinatorial structures
  • The enumeration of labeled graphs by number of cutpoints
  • The number of labeled dissections of a k-ball
  • COMBINATORIAL PROBLEMS IN THE THEORY OF GRAPHS. I
  • The number of connected sparsely edged graphs. II. Smooth graphs and blocks
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1607027&oldid=13910952"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 04:02.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki