Generating and counting unlabeled k-path graphs

DOI10.1016/J.DAM.2011.11.015zbMATH Open1321.05052OpenAlexW2072648397MaRDI QIDQ496683FDOQ496683

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

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

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)

Cites Work

• Title not available (Why is that?)
• Enumeration and asymptotic properties of unlabeled outerplanar graphs
• Title not available (Why is that?)
• Counting planar graphs and related families of graphs
• Properties and characterizations of k ‐trees
• A clique-difference encoding scheme for labelled \(k\)-path graphs
• Bell numbers and \(k\)-trees
• Subclasses of \(k\)-trees: characterization and recognition
• Title not available (Why is that?)
• Title not available (Why is that?)
• Generating unlabeled connected cubic planar graphs uniformly at random
• Title not available (Why is that?)

Cited In (6)

• Block-indifference graphs: characterization, structural and spectral properties
• Title not available (Why is that?)
• 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)