Generating and counting unlabeled \(k\)-path graphs
type: Item
instance of: scholarly article
title: Generating and counting unlabeled \(k\)-path graphs
zbMATH Open document ID: 1321.05052
author: Paulo Renato Da Costa Pereira
author: Alex Garcia
author: Lilian Markenzon
published in: Discrete Applied Mathematics
publication date: 2015-09-22T00:00:00Z
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C75
zbMATH DE Number: 6484202
zbMATH Keywords: enumerative combinatorics
zbMATH Keywords: \(k\)-path graphs
zbMATH Keywords: structural properties
MaRDI profile type: Publication
full work available at URL: j.dam.2011.11.015
OpenAlex ID: W2072648397
cites work: Properties and characterizations of k ‐trees
cites work: Q4288578
cites work: Enumeration and asymptotic properties of unlabeled outerplanar graphs
cites work: Generating unlabeled connected cubic planar graphs uniformly at random
cites work: Q4947393
cites work: Q3656240
cites work: Subclasses of \(k\)-trees: characterization and recognition
cites work: A clique-difference encoding scheme for labelled \(k\)-path graphs
cites work: Q3836524
cites work: Q5607734
cites work: Q3791172
cites work: Bell numbers and \(k\)-trees
DOI: 10.1016/J.DAM.2011.11.015
description: scientific article; zbMATH DE number 6484202