The induced path function, monotonicity and betweenness
From MaRDI portal
Publication:968160
DOI10.1016/J.DAM.2009.10.004zbMATH Open1225.05146OpenAlexW2116953536MaRDI QIDQ968160FDOQ968160
Authors: Manoj Changat, Henry Martyn Mulder, Joseph Mathews 
Publication date: 5 May 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://repub.eur.nl/pub/7874
Recommendations
- Characterizations of \(J\)-monotone graphs
- Induced path transit function, monotone and Peano axioms
- Betweenness in graphs: a short survey on shortest and induced path betweenness
- Axiomatic characterizations of Ptolemaic and chordal graphs
- A forbidden subgraph characterization of some graph classes using betweenness axioms
Cites Work
- Title not available (Why is that?)
- Convexity in Graphs and Hypergraphs
- Title not available (Why is that?)
- Convex sets in graphs. II: Minimal path convexity
- Convexities related to path properties on graphs
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Title not available (Why is that?)
- Algorithmic Aspects of Vertex Elimination on Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Convexity and HHD-Free Graphs
- The All-Paths Transit Function of a Graph
- A characterization of the interval function of a connected graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Axiomatic characterization of the interval function of a graph
- The induced path convexity, betweenness, and svelte graphs
- Title not available (Why is that?)
- On the semi-perfect elimination
- Some Elementary Properties of Interval Convexities
- Convex sets in a graph
- Title not available (Why is that?)
- Induced path transit function, monotone and Peano axioms
- Characterizations of \(J\)-monotone graphs
- Interval-regularity does not lead to interval monotonicity
- Title not available (Why is that?)
- A Characterization of the Interval Function of a (Finite or Infinite) Connected Graph
- A remark on Mulder's conjecture about interval-regular graphs
Cited In (23)
- On a metric related transit function and its betweenness
- Betweenness in graphs: a short survey on shortest and induced path betweenness
- Cut vertex transit functions of hypergraphs
- Characterizations of \(J\)-monotone graphs
- A note on 3-Steiner intervals and betweenness
- The induced path transit function and the Pasch axiom
- Triangle path transit functions, betweenness and pseudo-modular graphs
- Axiomatic characterization of the interval function of a block graph
- Axiomatic characterizations of Ptolemaic and chordal graphs
- Axiomatic characterization of transit functions of hierarchies
- Induced path transit function, monotone and Peano axioms
- Interval function, induced path function, (claw, paw)-free graphs and axiomatic characterizations
- Axiomatic characterization of the interval function of a bipartite graph
- A note on the interval function of a disconnected graph
- Axiomatic characterization of claw and paw-free graphs using graph transit functions
- The longest path transit function of a graph and betweenness
- Transit sets of \(k\)-point crossover operators
- Axiomatic characterization of transit functions of weak hierarchies
- The weak-toll function of a graph: axiomatic characterizations and first-order non-definability
- Axiomatic characterization of the interval function of a bipartite graph
- The axiomatic characterization of the interval function of distance hereditary graphs
- Axiomatic characterization of the toll walk function of some graph classes
- Segment transit function of the induced path function of graphs and its first-order definability
This page was built for publication: The induced path function, monotonicity and betweenness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968160)
