Generating and counting unlabeled k-path graphs

DOI10.1016/J.DAM.2011.11.015MaRDI QIDQ496683zbMATH OpenOpenAlexFDO

Authors Paulo Renato Da Costa Pereira, Alex Garcia, Lilian Markenzon

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)

Recommendations

• How to count \(k\)-paths
• On the number of labeled \(k\)-arch graphs
• Counting unlabeled \(k\)-trees
• An asymptotic analysis of unlabeled \(k\)-trees
• A clique-difference encoding scheme for labelled \(k\)-path graphs

Cites work

• scientific article; zbMATH DE number 4055646 (Why is no real title available?)
• scientific article; zbMATH DE number 1375584 (Why is no real title available?)
• scientific article; zbMATH DE number 554762 (Why is no real title available?)
• scientific article; zbMATH DE number 1432797 (Why is no real title available?)
• scientific article; zbMATH DE number 3329638 (Why is no real title available?)
• A clique-difference encoding scheme for labelled \(k\)-path graphs
• Bell numbers and \(k\)-trees
• Counting planar graphs and related families of graphs
• Enumeration and asymptotic properties of unlabeled outerplanar graphs
• Generating unlabeled connected cubic planar graphs uniformly at random
• Properties and characterizations of k ‐trees
• Subclasses of \(k\)-trees: characterization and recognition

Cited in

(6)

• Block-indifference graphs: characterization, structural and spectral properties
• scientific article; zbMATH DE number 2186889 (Why is no real title available?)
• How to count \(k\)-paths
• Counting and enumerating unlabeled split-indifference graphs
• On the number of labeled \(k\)-arch graphs
• A clique-difference encoding scheme for labelled \(k\)-path graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q496683)