Enumeration of connected graphs with cut vertices
From MaRDI portal
Publication:698029
DOI10.1016/S0378-3758(02)00225-2zbMATH Open0995.05067MaRDI QIDQ698029FDOQ698029
Authors: Ying-Lie Jin, Shinsei Tazawa, Teruhiro Shirakura 
Publication date: 18 September 2002
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Recommendations
Exact enumeration problems, generating functions (05A15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Enumeration in graph theory (05C30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- COMBINATORIAL PROBLEMS IN THE THEORY OF GRAPHS. I
- Enumeration of non-separable graphs
- A series of search designs for \(2^ m\) factorial designs of resolution V which permit search of one or two unknown extra three-factor interactions
- Enumeration of unlabelled bicolored graphs by degree parities
- Title not available (Why is that?)
- Title not available (Why is that?)
- Enumeration and Representation of Nonisomorphic Bipartite Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (6)
- On enumeration of labelled connected graphs by the number of cutpoints
- Patchworks and metablocks enumeration
- On the maximum Zagreb indices of graphs with \(k\) cut vertices
- Title not available (Why is that?)
- Symmetric regular cacti-properties and enumeration
- The enumeration of labeled graphs by number of cutpoints
This page was built for publication: Enumeration of connected graphs with cut vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q698029)
