Walk Domination and HHD-Free Graphs

DOI10.1007/S00373-024-02771-YMaRDI QIDQ6489357zbMATH OpenFDO

Authors Silvia B. Tondato

Publication date 21 April 2024

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

Full work available at URL https://doi.org/10.1007/S00373-024-02771-Y

Mathematics Subject Classification ID

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

Recommendations

• Convexity and HHD-Free Graphs
• Finding houses and holes in graphs
• A note on path domination
• Lexbfs-orderings and powers of hhd-free graphs^∗
• A new characterization of HH-free graphs

Cites work

• A characterization of the interval function of a connected graph
• A note on path domination
• A note on superbrittle graphs
• Algorithmic Aspects of Vertex Elimination on Graphs
• Convex geometries over induced paths with bounded length
• Convexity and HHD-Free Graphs
• Convexity in Graphs and Hypergraphs
• scientific article; zbMATH DE number 1449370 (Why is no real title available?)
• On extreme points of regular convex sets
• On local convexity in graphs
• On rigid circuit graphs
• On the semi-perfect elimination
• On triangle path convexity in graphs
• Representation of a finite graph by a set of intervals on the real line
• The All-Paths Transit Function of a Graph
• The longest path transit function of a graph and betweenness
• Toll convexity
• Triangulated graphs and the elimination process

Cited in

(1)

• On a problem of L. Alcón concerning path domination

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6489357)