Inversions, cuts, and orientations
- 31 January 1991
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 87 (2) , 163-174
- https://doi.org/10.1016/0012-365x(91)90045-4
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Is there a diagram invariant?Discrete Mathematics, 1989
- Complexity of diagramsOrder, 1987
- On reorienting graphs by pushing down maximal verticesOrder, 1986
- On graphs that can be oriented as diagrams of ordered setsOrder, 1985
- Retracts of hypercubesJournal of Graph Theory, 1984
- Graphs orientable as distributive latticesProceedings of the American Mathematical Society, 1983
- Path length in the covering graph of a latticeDiscrete Mathematics, 1977
- Planar LatticesCanadian Journal of Mathematics, 1975
- Unoriented graphs of modular latticesCzechoslovak Mathematical Journal, 1975
- On lattices whose graphs are isomorphicCzechoslovak Mathematical Journal, 1954