Schnittverbände in Graphen. (Intersection lattices in graphs)

DOI10.1007/BF02996932zbMath0239.05131OpenAlexW2067913724WikidataQ56505558 ScholiaQ56505558MaRDI QIDQ2553451

F. Escalante

Publication date: 1972

Published in: Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02996932

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Complete lattices, completions (06B23) Structure and representation theory of distributive lattices (06D05) Graph theory (05Cxx)

Related Items

Listing all the minimal separators of a 3-connected planar graph ⋮ On Vertices of outdegree n in minimally n‐connected digraphs ⋮ Circuits through prescribed vertices in k‐connected k‐regular graphs ⋮ Representing a concept lattice by a graph ⋮ On the Cooperative Graph Searching Problem ⋮ Depletable channels: dynamics, behaviour, and efficiency in network design ⋮ On primitive sets in graphs ⋮ On the lattices of cutsets in finite graphs ⋮ Lattices of cuts in graphs ⋮ Note über Kantenschnittverbände in Graphen ⋮ Über n-fach zusammenhängende Eckenmengen in Graphen ⋮ Zur Struktur minimal n-fach zusammenhängender Graphen ⋮ A dynamic graph characterisation of the fixed part of the controllable subspace of a linear structured system ⋮ GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH ⋮ Lattices of crosscuts

Cites Work

• Über trennende Eckenmengen in Graphen und den Mengerschen Satz