KIAM Main page Web Library  •  Publication Searh  Русский 

Conference material: "Academician O.B. Lupanov XIV International Scientific Seminar "Discrete Mathematics and Its Applications" (20-25 June 2022, Moscow)"
Authors: Kuzmin N.A., Malyshev D.S.
On connected subcubic graphs with n vertices and n+3 edges having maximum number of matchings
The paper completely describes connected (n,n+3)-graphs of maximal degree 3, which have the largest number of matchings.
subcubic graphs, cubic graphs, matchings
Publication language: russian,  pages: 3 (p. 191-193)
Russian source text:
Export link to publication in format:   RIS    BibTeX
About authors: