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

DOI10.1007/BF02996932MaRDI QIDQ2553451zbMATH OpenOpenAlexWikidataFDO

Authors 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) Graph theory (05Cxx) Complete lattices, completions (06B23) Structure and representation theory of distributive lattices (06D05)

Cites work

• Über trennende Eckenmengen in Graphen und den Mengerschen Satz

Cited in

(19)

• On primitive sets in graphs
• On the lattices of cutsets in finite graphs
• Lattices of cuts in graphs
• Über n-fach zusammenhängende Eckenmengen in Graphen
• Zur Struktur minimal n-fach zusammenhängender Graphen
• Representing a concept lattice by a graph
• A dynamic graph characterisation of the fixed part of the controllable subspace of a linear structured system
• Depletable channels: dynamics, behaviour, and efficiency in network design
• Note über Kantenschnittverbände in Graphen
• On Vertices of outdegree n in minimally n‐connected digraphs
• Circuits through prescribed vertices in k‐connected k‐regular graphs
• On the Cooperative Graph Searching Problem
• GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH
• Partial reflections and globally linked pairs in rigid graphs
• Finding diverse minimum s-t cuts
• A graph multi-separator problem for image segmentation
• Finding diverse solutions in combinatorial problems with a distributive lattice structure
• Lattices of crosscuts
• Listing all the minimal separators of a 3-connected planar graph

This page was built for publication: Schnittverbände in Graphen. (Intersection lattices in graphs)

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