Axiomatic characterization of the toll walk function of some graph classes
From MaRDI portal
Publication:6132559
Recommendations
- Characterizing \((\ell ,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
- scientific article; zbMATH DE number 1842910 (Why is no real title available?)
- scientific article; zbMATH DE number 970795 (Why is no real title available?)
- 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
- 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
(2)
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)