Uniformly dissociated graphs

DOI10.26493/1855-3974.1013.46azbMath1380.05148OpenAlexW2605443665MaRDI QIDQ4604516

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

zbMATH Keywords

girthMoore graphwell-covered graphsdissociation numberpolarity graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

The geodesic-transversal problem, General d-position sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On computing the minimum 3-path vertex cover and dissociation number of graphs
• Limited packings in graphs
• A characterization of well covered graphs of girth 5 or greater
• Graphs of diameter two with no 4-circuits
• On the \(k\)-path vertex cover of some graph products
• Minimum \(k\)-path vertex cover
• The complexity of dissociation set problems in graphs
• On the vertex \(k\)-path cover
• The complexity of restricted spanning tree problems
• MOORE GEOMETRIES AND RANK 3 GROUPS HAVING μ=1
• Polarity graphs revisited
• Some covering concepts in graphs
• Geodetic graphs of diameter two