The total number of matchings in triangle graph of a connected graph.
From MaRDI portal
Publication:2804756
zbMATH Open1349.05270MaRDI QIDQ2804756FDOQ2804756
Authors: Libing Zhang, Hongbo Hua 
Publication date: 4 May 2016
Published in: Ars Combinatoria (Search for Journal in Brave)
Recommendations
- Sharp lower bound for the total number of matchings of tricyclic graphs
- Total domination and matching numbers in graphs with all vertices in triangles
- scientific article; zbMATH DE number 12944
- A note on the matching numbers of triangle-free graphs
- On the number of matchings of graphs formed by a graph operation
Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
This page was built for publication: The total number of matchings in triangle graph of a connected graph.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2804756)
