Axiomatic Characterization of Claw and Paw-Free Graphs Using Graph Transit Functions

DOI10.1007/978-3-319-29221-2_10zbMath1437.05115OpenAlexW2407681566MaRDI QIDQ2795939

Ferdoos Hossein Nezhad, Manoj Changat, Narayanan Narayanan

Publication date: 23 March 2016

Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-29221-2_10

zbMATH Keywords

Hamiltonian graphclaw-free graphsinterval functionpaw-free graphsinduced path function

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Eulerian and Hamiltonian graphs (05C45)

Related Items

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 ⋮ Betweenness in graphs: a short survey on shortest and induced path betweenness

Cites Work

• The induced path function, monotonicity and betweenness
• Axiomatic characterization of the interval function of a graph
• Convex sets in graphs. II: Minimal path convexity
• Forbidden subgraphs and Hamiltonian properties and graphs
• The induced path convexity, betweenness, and svelte graphs
• Convexities related to path properties on graphs
• Induced path transit function, monotone and Peano axioms
• A forbidden subgraph characterization of some graph classes using betweenness axioms
• Sufficient conditions for a graph to be Hamiltonian
• Axiomatic characterization of the interval function of a block graph
• The All-Paths Transit Function of a Graph
• A Characterization of the Interval Function of a (Finite or Infinite) Connected Graph
• A characterization of the interval function of a connected graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item