Regular graphs with maximum forest number

DOI10.1007/978-3-642-24983-9_2MaRDI QIDQ3098061zbMATH OpenOpenAlexFDO

Authors Avapa Chantasartrassmee, N. Punnim

Publication date 11 November 2011

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-24983-9_2

Mathematics Subject Classification ID

Trees (05C05) Vertex degrees (05C07) Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)

Recommendations

• On the number of forests and connected spanning subgraphs
• Constrained switchings in cubic graphs.
• Upper bound for the number of spanning forests of regular graphs
• The regular number of a graph
• The forest number in several classes of regular graphs

Cited in

(2)

• scientific article; zbMATH DE number 4137789 (Why is no real title available?)
• Constrained switchings in cubic graphs.

This page was built for publication: Regular graphs with maximum forest number

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