On Halin-lattices in graphs

DOI10.1016/0012-365X(83)90094-8zbMATH Open0527.05060OpenAlexW1998054037MaRDI QIDQ595689FDOQ595689

Authors: Michael Hager 

Publication date: 1983

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(83)90094-8

zbMATH Keywords

contractionbridgecomplete lattice of H-primitive setscontravariant functorinfinite sequence of H-lattices of rooted treeslattice homomorphismsprimitive setsseparating sets of verticeswell quasi-order

Mathematics Subject Classification ID

Partial orders, general (06A06) Connectivity (05C40) Graph theory (05C99) Lattices (06B99)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On primitive sets in graphs
• Über trennende Eckenmengen in Graphen und den Mengerschen Satz
• Weak Separation Lattices of Graphs
• Treillis de Séparation des Graphes

Cited In (2)

• Representing a concept lattice by a graph
• On maps related to Halin separation lattices

This page was built for publication: On Halin-lattices in graphs

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