On the Core of a Graph†
From MaRDI portal
Publication:5532263
Cited in
(10)- On unique independent sets in graphs
- On disjoint matchings in cubic graphs
- On edge-disjoint pairs of matchings
- Characterization of a class of graphs related to pairs of disjoint matchings
- A note on graphs contraction-critical with respect to independence number
- Planar bus graphs
- Free adequate semigroups.
- On disjoint matchings in cubic graphs: maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs
- A note on minimal matching covered graphs
- Graphs with unique maximum independent sets
This page was built for publication: On the Core of a Graph†
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5532263)