Uniformly dissociated graphs

DOI10.26493/1855-3974.1013.46AMaRDI QIDQ4604516zbMATH OpenOpenAlexWikidataFDO

Authors Boštjan Brešar, Douglas F. Rall, 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

zbMATH Keywords

girthMoore graphwell-covered graphsdissociation numberpolarity graph

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 2192124 (Why is no real title available?)
• A characterization of well covered graphs of girth 5 or greater
• Equipackable graphs
• Geodetic graphs of diameter two
• Graphs of diameter two with no 4-circuits
• Limited packings in graphs
• MOORE GEOMETRIES AND RANK 3 GROUPS HAVING μ=1
• Minimum \(k\)-path vertex cover
• On computing the minimum 3-path vertex cover and dissociation number of graphs
• On the \(k\)-path vertex cover of some graph products
• On the vertex \(k\)-path cover
• Polarity graphs revisited
• Some covering concepts in graphs
• The complexity of dissociation set problems in graphs
• The complexity of restricted spanning tree problems

Cited in

(5)

• The geodesic-transversal problem
• Maximal and maximum dissociation sets in general and triangle-free graphs
• Uniformly cordial graphs
• General \(d\)-position sets
• Uniformly connected graphs

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)