On the Core of a Graph†
From MaRDI portal
Publication:5532263
DOI10.1112/PLMS/S3-17.2.305zbMATH Open0152.41204OpenAlexW2084309445MaRDI QIDQ5532263FDOQ5532263
Authors: Michael D. Plummer, Frank Harary 
Publication date: 1967
Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/2027.42/135576
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)
