Generating and counting unlabeled \(k\)-path graphs

DOI10.1016/j.dam.2011.11.015zbMath1321.05052OpenAlexW2072648397MaRDI QIDQ496683

Alex Garcia, Lilian Markenzon, Paulo Renato da Costa Pereira

Publication date: 22 September 2015

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

Full work available at URL: https://doi.org/10.1016/j.dam.2011.11.015

zbMATH Keywords

structural propertiesenumerative combinatorics\(k\)-path graphs

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Structural characterization of families of graphs (05C75)

Related Items (3)

Counting and enumerating unlabeled split–indifference graphs ⋮ Unnamed Item ⋮ Block-indifference graphs: characterization, structural and spectral properties

Cites Work

• A clique-difference encoding scheme for labelled \(k\)-path graphs
• Enumeration and asymptotic properties of unlabeled outerplanar graphs
• Bell numbers and \(k\)-trees
• Subclasses of \(k\)-trees: characterization and recognition
• Generating unlabeled connected cubic planar graphs uniformly at random
• Properties and characterizations of k ‐trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generating and counting unlabeled \(k\)-path graphs