The induced path function, monotonicity and betweenness
type: Item
instance of: scholarly article
title: The induced path function, monotonicity and betweenness
zbMATH Open document ID: 1225.05146
author: Manoj Changat
author: Henry Martyn Mulder
author: Joseph Mathews
published in: Discrete Applied Mathematics
publication date: 2010-05-05T00:00:00Z
full work available at URL: http://repub.eur.nl/pub/7874
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 03C13
zbMATH DE Number: 5703744
zbMATH Keywords: transit function
zbMATH Keywords: induced path
zbMATH Keywords: betweenness
zbMATH Keywords: monotone
zbMATH Keywords: long cycle
zbMATH Keywords: house
zbMATH Keywords: domino
zbMATH Keywords: \(P\)-graph
MaRDI profile type: Publication
OpenAlex ID: W2116953536
cites work: Some Elementary Properties of Interval Convexities
cites work: The All-Paths Transit Function of a Graph
cites work: Q4519732
cites work: Induced path transit function, monotone and Peano axioms
cites work: Q5506516
cites work: Convexities related to path properties on graphs
cites work: Convexity and HHD-Free Graphs
cites work: Q3787039
cites work: Convex sets in graphs. II: Minimal path convexity
cites work: Q4519717
cites work: Convexity in Graphs and Hypergraphs
cites work: On the semi-perfect elimination
cites work: Q3940405
cites work: Q4264556
cites work: Interval-regularity does not lead to interval monotonicity
cites work: The induced path convexity, betweenness, and svelte graphs
cites work: Q3890733
cites work: Q5506523
cites work: Axiomatic characterization of the interval function of a graph
cites work: A characterization of the interval function of a connected graph
cites work: Q4955672
cites work: A Characterization of the Interval Function of a (Finite or Infinite) Connected Graph
cites work: Q4783803
cites work: A remark on Mulder's conjecture about interval-regular graphs
cites work: Algorithmic Aspects of Vertex Elimination on Graphs
cites work: Convex sets in a graph
cites work: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
cites work: Q3141898
DOI: 10.1016/J.DAM.2009.10.004
description: scientific article; zbMATH DE number 5703744