A forbidden subgraph characterization of some graph classes using betweenness axioms

DOI10.1016/j.disc.2013.01.013zbMath1262.05106OpenAlexW2005399875MaRDI QIDQ1946665

Anandavally K. Lakshmikuttyamma, Manoj Changat, Simon Špacapan, Geetha Seethakuttyamma, Iztok Peterin, Joseph Mathews, G. Narasimha-Shenoi Prasanth

Publication date: 15 April 2013

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2013.01.013

zbMATH Keywords

chordal graphsdistance hereditary graphsforbidden subgraphsinterval functioninduced pathbetweenness axioms

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Distance in graphs (05C12) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (12)

Axiomatic characterization of the interval function of a block graph ⋮ 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 characterization of the toll walk function of some graph classes ⋮ 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 ⋮ The induced path transit function and the Pasch axiom ⋮ Axiomatic Characterization of Claw and Paw-Free Graphs Using Graph Transit Functions ⋮ Betweenness in graphs: a short survey on shortest and induced path betweenness

This page was built for publication: A forbidden subgraph characterization of some graph classes using betweenness axioms