Inversions, cuts, and orientations

DOI10.1016/0012-365X(91)90045-4zbMATH Open0721.06001MaRDI QIDQ2640623FDOQ2640623

Ivan Rival, Weiping Liu

Publication date: 1991

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

zbMATH Keywords

diagramcomplexityenumerationinversionpushdownorientation of covering graphreorientation of an ordered set

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Partial orders, general (06A06) Combinatorics of partially ordered sets (06A07)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Retracts of hypercubes
• Graphs Orientable as Distributive Lattices
• Path length in the covering graph of a lattice
• Complexity of diagrams
• Planar Lattices
• Antichain cutsets
• On reorienting graphs by pushing down maximal vertices
• On graphs that can be oriented as diagrams of ordered sets
• Is there a diagram invariant?
• Diagrams, orientations, and varieties
• Unoriented graphs of modular lattices

Cited In (5)

• Orientations of chain groups
• Inversions
• Obituary: Ivan Rival
• On reorienting graphs by pushing down maximal vertices. II
• Enumerating orientations of ordered sets

This page was built for publication: Inversions, cuts, and orientations

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