Graphs orientable as distributive lattices-Reference-Cited by-同舟云学术

Graphs orientable as distributive lattices

Published:1983 Issue:2 Volume:88 Page:197-200
ISSN:0002-9939
Container-title:Proceedings of the American Mathematical Society
language:en
Short-container-title:Proc. Amer. Math. Soc.

Author:

Duffus Dwight,Rival Ivan

Abstract

There are two types of graphs commonly associated with finite (partially) ordered sets: the comparability graph and the covering graph. While the first type has been characterized, only partial descriptions of the second are known. We prove that the covering graphs of distributive lattices are precisely those graphs which are retracts of hypercubes.

Publisher

American Mathematical Society (AMS)

Subject

Applied Mathematics,General Mathematics

Link

http://www.ams.org/proc/1983-088-02/S0002-9939-1983-0695239-4/S0002-9939-1983-0695239-4.pdf

Reference10 articles.

1. M. Aigner and G. Prins, 𝑘-orientable graphs (preprint 1980).

2. Undirected graphs realizable as graphs of modular lattices;Alvarez, Laurence R.;Canadian J. Math.,1965

3. Path length in the covering graph of a lattice;Duffus, Dwight;Discrete Math.,1977

4. Caractérisation des graphes non orientés dont on peut orienter les arětes de manière à obtenir le graphe d’une relation d’ordre;Ghouila-Houri, Alain;C. R. Acad. Sci. Paris,1962

5. A characterization of comparability graphs and of interval graphs;Gilmore, P. C.;Canadian J. Math.,1964

Cited by 18 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Resonance Graphs on Perfect Matchings of Graphs on Surfaces;Graphs and Combinatorics;2023-06-15

2. Distributive lattice structure on the set of perfect matchings of carbon nanotubes;Journal of Mathematical Chemistry;2016-03-09

3. Non-matchable distributive lattices;Discrete Mathematics;2015-03

4. Counting vertices and cubes in median graphs of circular split systems;European Journal of Combinatorics;2008-02

5. Graph homomorphisms: structure and symmetry;Graph Symmetry;1997