Axiomatic characterization of the interval function of a block graph
From MaRDI portal
Publication:2407023
DOI10.1016/j.disc.2015.01.004zbMath1371.05170OpenAlexW2002196615MaRDI QIDQ2407023
Manoj Changat, Kannan Balakrishnan, Anandavally K. Lakshmikuttyamma, Narayanan Narayanan, Joseph Mathews, G. Narasimha-Shenoi Prasanth, Henry Martyn Mulder
Publication date: 28 September 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2015.01.004
Related Items (11)
Cut vertex transit functions of hypergraphs ⋮ Interval function, induced path function, (claw, paw)-free graphs and axiomatic characterizations ⋮ A note on the interval function of a disconnected graph ⋮ The axiomatic characterization of the interval function of distance hereditary graphs ⋮ Axiomatic characterizations of Ptolemaic and chordal graphs ⋮ First-order logic axiomatization of metric graph theory ⋮ Axiomatic characterization of the interval function of a bipartite graph ⋮ Axiomatic Characterization of the Interval Function of a Bipartite Graph ⋮ Axiomatic characterization of transit functions of weak hierarchies ⋮ Axiomatic Characterization of Claw and Paw-Free Graphs Using Graph Transit Functions ⋮ Betweenness in graphs: a short survey on shortest and induced path betweenness
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finite Sholander trees, trees, and their betweenness
- The induced path function, monotonicity and betweenness
- Axiomatic characterization of the interval function of a graph
- Triangle path transit functions, betweenness and pseudo-modular graphs
- Pseudo-modular graphs
- The structure of median graphs
- Median graphs and Helly hypergraphs
- On triangle path convexity in graphs
- The induced path convexity, betweenness, and svelte graphs
- Convexities related to path properties on graphs
- A forbidden subgraph characterization of some graph classes using betweenness axioms
- The All-Paths Transit Function of a Graph
- A Characterization of the Interval Function of a (Finite or Infinite) Connected Graph
- Induced Path Transit Function, Betweenness and Monotonicity
- Représentations en arbre de proximités relatives
- A characterization of the interval function of a connected graph
- Segments of Ordered Sets
- Trees, Lattices, Order, and Betweenness
- Medians and Betweenness
- Transitivities of Betweenness
This page was built for publication: Axiomatic characterization of the interval function of a block graph