Path length in the covering graph of a lattice

DOI10.1016/0012-365X(77)90029-2zbMath0372.06005OpenAlexW1987112368MaRDI QIDQ1244343

Dwight Duffus, Ivan Rival

Publication date: 1977

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

Full work available at URL: https://doi.org/10.1016/0012-365x(77)90029-2

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structure theory of lattices (06B05)

Related Items

Graph isomorphic discrete partially ordered sets and semimodularity, Planar graded lattices and the \(c_1\)-median property, Graph Automorphisms and Cells of Lattices, Unnamed Item, Inversions, cuts, and orientations, Distributive lattices with strong endomorphism kernel property as direct sums, On the covering graph of balanced lattices, Incomparability graphs of the lattices \(L_{n}\) and \(L_n^{1^2}\), Lattices, whose incomparability graphs have horns, Graphs Orientable as Distributive Lattices, A structure theory for ordered sets, Metrics on partially ordered sets - a survey, A distance metric on binary trees using lattice-theoretic measures, Hereditarily strong lattices, Constructions of \(S\)-lattices, \(n\)-median semilattices, Cover-preserving order embeddings into Boolean lattices, Lattices contained in planar orders are planar, Unnamed Item, The annihilator graph of a 0-distributive lattice, A note on the zero divisor graph of a lattice, Absolute retracts of bipartite graphs, Obituary: Ivan Rival, Medians in median graphs, On graphs that can be oriented as diagrams of ordered sets, Incomparability Graphs of Lattices, An ideal-based graph of a bounded lattice

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatorial inequalities for semimodular lattices of breadth two
• Planar lattices and planar graphs
• Height on posets and graphs
• Crowns, Fences, and Dismantlable Lattices
• The selfdual kernel of Birkhoff's conditions in lattices with finite chains
• Planar Lattices
• Unoriented graphs of modular lattices
• Centrally symmetric graphs
• Undirected Graphs Realizable as Graphs of Modular Lattices
• Centrally symmetric Hasse diagrams of finite modular lattices
• On some properties of a pair of lattices