scientific article; zbMATH DE number 1842910

zbMath1003.05063MaRDI QIDQ4783803

Ladislav Nebeský

Publication date: 9 December 2002

Full work available at URL: https://eudml.org/doc/228361

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

connected graphternary relationfinite structureinduced path

Mathematics Subject Classification ID

Paths and cycles (05C38) Model theory of finite structures (03C13)

Related Items (18)

The connected graphs obtained from finite projective planes ⋮ Cut vertex transit functions of hypergraphs ⋮ Axiomatic characterization of transit functions of hierarchies ⋮ The Directed Geodetic Structure of a Strong Digraph ⋮ Axiomatic characterization of the interval function of a block graph ⋮ Guides and shortcuts in graphs ⋮ 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 ⋮ Segment transit function of the induced path function of graphs and its first-order definability ⋮ Axiomatic characterizations of Ptolemaic and chordal graphs ⋮ Axiomatic characterization of the interval function of a bipartite graph ⋮ Axiomatic Characterization of the Interval Function of a Bipartite Graph ⋮ The induced path function, monotonicity and betweenness ⋮ 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: