Axiomatic characterization of the toll walk function of some graph classes

DOI10.1007/978-3-031-25211-2_33MaRDI QIDQ6132559zbMATH OpenOpenAlexFDO

Authors Lekshmi Kamal K. Sheela, Manoj Changat, Iztok Peterin

Publication date 17 August 2023

Published in Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-25211-2_33

zbMATH Keywords

\textit{AT}-free graphsaxiomatic characterizationinterval graphstoll walktransit function

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Characterizing ( ,m)-walk-regular graphs
• On the toll number of a graph
• Axiomatic characterization of the interval function of a graph
• On the characterization of path graphs
• Toll path domination in graphs
• scientific article; zbMATH DE number 68918
• Axiomatic characterization of the interval function of a block graph
• Axiomatic characterization of the interval function of a bipartite graph
• Axiomatic characterization of the interval function of a bipartite graph
• scientific article; zbMATH DE number 2104724

Cites work

• A forbidden subgraph characterization of some graph classes using betweenness axioms
• A note on path domination
• A survey of hereditary properties of graphs
• Asteroidal triple-free graphs
• Axiomatic characterization of the interval function of a graph
• Computing the hull number in toll convexity
• Finite Sholander trees, trees, and their betweenness
• scientific article; zbMATH DE number 1842910 (Why is no real title available?)
• scientific article; zbMATH DE number 970795 (Why is no real title available?)
• Recognizing graphs without asteroidal triples
• Representation of a finite graph by a set of intervals on the real line
• The All-Paths Transit Function of a Graph
• The induced path function, monotonicity and betweenness
• Toll convexity
• Toll number of the Cartesian and the lexicographic product of graphs
• Toll number of the strong product of graphs
• Trees, Lattices, Order, and Betweenness

Cited in

(6)

• The weak-toll function of a graph: axiomatic characterizations and first-order non-definability
• Axiomatic characterization of the interval function of partial cubes and partial Hamming graphs
• The toll walk transit function of a graph: axiomatic characterizations and first-order non-definability
• Convex geometries yielded by transit functions
• Directed transit functions
• On the stress transit function

This page was built for publication: Axiomatic characterization of the toll walk function of some graph classes

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