Enumerating rooted graphs with reflectional block structures

DOI10.1007/978-3-642-13073-1_6MaRDI QIDQ3562991zbMATH OpenOpenAlexFDO

Authors Bingbing Zhuang, Hiroshi Nagamochi

Publication date 28 May 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13073-1_6

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• On the enumeration of a class of plane multigraphs
• Constant Time Generation of Biconnected Rooted Plane Graphs
• Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs
• Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs
• scientific article; zbMATH DE number 5606398

Cited in

(1)

• scientific article; zbMATH DE number 743880 (Why is no real title available?)

This page was built for publication: Enumerating rooted graphs with reflectional block structures

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