Well-located graphs: A collection of well-covered ones

DOI10.1016/S0012-365X(03)00297-8zbMath1031.05094MaRDI QIDQ1422424

Arthur S. Finbow, Bert L. Hartnell

Publication date: 14 February 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

IndependenceWell-coveredDominatingLocatingMaximum independent

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Liar's domination

Cites Work

• A characterization of well covered graphs of girth 5 or greater
• Domination and location in acyclic graphs
• On some subclasses of well-covered graphs
• WELL-COVERED GRAPHS: A SURVEY
• Some covering concepts in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Well-located graphs: A collection of well-covered ones