Uniformly dissociated graphs
DOI10.26493/1855-3974.1013.46AzbMATH Open1380.05148OpenAlexW2605443665WikidataQ129358915 ScholiaQ129358915MaRDI QIDQ4604516FDOQ4604516
Douglas F. Rall, Boštjan Brešar, Bert L. Hartnell
Publication date: 26 February 2018
Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.26493/1855-3974.1013.46a
Recommendations
- Maximal and maximum dissociation sets in general and triangle-free graphs
- A bound on the dissociation number
- On the maximal number of maximum dissociation sets in forests with fixed order and dissociation number
- Relating dissociation, independence, and matchings
- Complexity of dissociate set problems in some hereditary classes of graphs
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)
Cites Work
- Title not available (Why is that?)
- A characterization of well covered graphs of girth 5 or greater
- Some covering concepts in graphs
- On the \(k\)-path vertex cover of some graph products
- Minimum \(k\)-path vertex cover
- On the vertex \(k\)-path cover
- On computing the minimum 3-path vertex cover and dissociation number of graphs
- Limited packings in graphs
- Title not available (Why is that?)
- The complexity of restricted spanning tree problems
- Title not available (Why is that?)
- Geodetic graphs of diameter two
- The complexity of dissociation set problems in graphs
- Graphs of diameter two with no 4-circuits
- Polarity graphs revisited
- MOORE GEOMETRIES AND RANK 3 GROUPS HAVING μ=1
Cited In (4)
This page was built for publication: Uniformly dissociated graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4604516)
