Chordal 2‐Connected Graphs and Spanning Trees

DOI10.1002/jgt.21761zbMath1296.05112OpenAlexW1772094952MaRDI QIDQ5495883

Zbigniew R. Bogdanowicz

Publication date: 7 August 2014

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.21761

zbMATH Keywords

minimizationspanning treechordal graphthreshold graphenumeration of treesshift transformation

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

Extremal graphs for the Tutte polynomial ⋮ Graph vulnerability parameters, compression, and threshold graphs ⋮ On the minimum number of spanning trees in cubic multigraphs

Cites Work

• Undirected simple connected graphs with minimum number of spanning trees
• Counting labelled chordal graphs
• A certain polynomial of a graph and graphs with an extremal number of trees
• Enumeration of \(P_4\)-free chordal graphs
• A characterization of perfect graphs
• A reliability-improving graph transformation with applications to network reliability
• Network transformations and bounding network reliability

This page was built for publication: Chordal 2‐Connected Graphs and Spanning Trees