Walk Domination and HHD-Free Graphs

DOI10.1007/S00373-024-02771-YMaRDI QIDQ6489357

Silvia B. Tondato

Publication date: 21 April 2024

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• A note on path domination
• On rigid circuit graphs
• A note on superbrittle graphs
• On local convexity in graphs
• On triangle path convexity in graphs
• On the semi-perfect elimination
• Convex geometries over induced paths with bounded length
• Toll convexity
• Triangulated graphs and the elimination process
• The All-Paths Transit Function of a Graph
• Representation of a finite graph by a set of intervals on the real line
• Convexity in Graphs and Hypergraphs
• Algorithmic Aspects of Vertex Elimination on Graphs
• Convexity and HHD-Free Graphs
• A characterization of the interval function of a connected graph
• On extreme points of regular convex sets

This page was built for publication: Walk Domination and HHD-Free Graphs