On matching number, decomposition and representation of well-formed graph

DOI10.5614/EJGTA.2023.11.2.13MaRDI QIDQ6090331zbMATH OpenOpenAlexFDO

Authors

Publication date 16 December 2023

Published in Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution-ShareAlike 4.0 International

Full work available at URL https://doi.org/10.5614/ejgta.2023.11.2.13

zbMATH Keywords

cubic graphhairy cyclenon-traceable cubic bridge graph (NTCBG)well-formed graph

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Structural characterization of families of graphs (05C75) Graph designs and isomorphic decomposition (05C51)

Recommendations

• Decompositions of cubic traceable graphs
• Matching covered graphs
• scientific article; zbMATH DE number 6303054
• A new lower bound on the number of perfect matchings in cubic graphs
• scientific article; zbMATH DE number 568824

Cites work

• scientific article; zbMATH DE number 2230923 (Why is no real title available?)
• On the corona of two graphs
• Spanning \(k\)-ended trees of 3-regular connected graphs

Cited in

(1)

• On the number of matchings of graphs formed by a graph operation

This page was built for publication: On matching number, decomposition and representation of well-formed graph

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