Path length in the covering graph of a lattice
type: Item
instance of: scholarly article
title: Path length in the covering graph of a lattice
zbMATH Open document ID: 0372.06005
DOI: 10.1016/0012-365X(77)90029-2
author: Dwight Duffus
author: Ivan Rival
published in: Discrete Mathematics
publication date: 1977-01-01T00:00:00Z
Mathematics Subject Classification ID: 06B05
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 3578890
MaRDI profile type: Publication
cites work: Undirected Graphs Realizable as Graphs of Modular Lattices
cites work: Q5331549
cites work: Height on posets and graphs
cites work: Q5820602
cites work: Q5832095
cites work: Unoriented graphs of modular lattices
cites work: Q5181402
cites work: On some properties of a pair of lattices
cites work: Crowns, Fences, and Dismantlable Lattices
cites work: Planar Lattices
cites work: Centrally symmetric graphs
cites work: Q5676236
cites work: Q5676237
cites work: Q4405190
cites work: Planar lattices and planar graphs
cites work: Combinatorial inequalities for semimodular lattices of breadth two
cites work: The selfdual kernel of Birkhoff's conditions in lattices with finite chains
cites work: Centrally symmetric Hasse diagrams of finite modular lattices
full work available at URL: 0012-365x(77)90029-2
OpenAlex ID: W1987112368
description: scientific article; zbMATH DE number 3578890