Axiomatic Characterization of the Interval Function of a Bipartite Graph
From MaRDI portal
Publication:2971638
DOI10.1007/978-3-319-53007-9_9zbMath1487.05183OpenAlexW2583567676MaRDI QIDQ2971638
Ferdoos Hossein Nezhad, Manoj Changat, Narayanan Narayanan
Publication date: 7 April 2017
Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-53007-9_9
Paths and cycles (05C38) Distance in graphs (05C12) Connectivity (05C40) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (3)
Interval function, induced path function, (claw, paw)-free graphs and axiomatic characterizations ⋮ Axiomatic characterizations of Ptolemaic and chordal graphs ⋮ Betweenness in graphs: a short survey on shortest and induced path betweenness
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finite Sholander trees, trees, and their betweenness
- The induced path transit function and the Pasch axiom
- The induced path function, monotonicity and betweenness
- Axiomatic characterization of the interval function of a graph
- Convex sets in graphs. II: Minimal path convexity
- The induced path convexity, betweenness, and svelte graphs
- A note on the interval function of a disconnected graph
- Convexities related to path properties on graphs
- Induced path transit function, monotone and Peano axioms
- A forbidden subgraph characterization of some graph classes using betweenness axioms
- Axiomatic characterization of the interval function of a block graph
- The All-Paths Transit Function of a Graph
- Axiomatic Characterization of Claw and Paw-Free Graphs Using Graph Transit Functions
- A Characterization of the Interval Function of a (Finite or Infinite) Connected Graph
- A characterization of the interval function of a connected graph
- Medians and Betweenness
This page was built for publication: Axiomatic Characterization of the Interval Function of a Bipartite Graph
