scientific article; zbMATH DE number 3482393
From MaRDI portal
Publication:4065587
Cited in
(11)- Undirected distances and the postman-structure of graphs
- The two ear theorem on matching-covered graphs
- On n-extendable graphs
- Matchings in regular graphs
- Matching theory -- a sampler: From Dénes König to the present
- On minimal elementary bipartite graphs
- \(k\)-cycle resonant graphs
- Planar \(k\)-cycle resonant graphs with \(k=1,2\)
- Reducible chains of planar 1-cycle resonant graphs
- Construction for bicritical graphs and \(k\)-extendable bipartite graphs
- Minimum degree of minimal (n-10)-factor-critical graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4065587)