Cut vertex transit functions of hypergraphs

DOI10.1007/978-3-030-67899-9_17OpenAlexW3128880785MaRDI QIDQ831720FDOQ831720

Authors: Manoj Changat, Ferdoos Hossein Nezhad, Peter F. Stadler 

Publication date: 24 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-67899-9_17

zbMATH Keywords

convexityblock graphscut verticestransit function

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The All-Paths Transit Function of a Graph
• A characterization of the interval function of a connected graph
• 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?)
• The induced path function, monotonicity and betweenness
• An observation on block graphs
• Induced path transit function, monotone and Peano axioms
• The induced path transit function and the Pasch axiom
• Axiomatic characterization of the interval function of a block graph
• Axiomatic characterization of transit functions of hierarchies
• A Characterization of the Interval Function of a (Finite or Infinite) Connected Graph
• Connectivity in hypergraphs
• Axiomatic characterization of transit functions of weak hierarchies

Cited In (3)

• Transit functions and pyramid-like binary clustering systems
• Hypergraph Cuts with General Splitting Functions
• On the cut-vertex and the interval transit functions of hypergraphs

This page was built for publication: Cut vertex transit functions of hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831720)