On reorienting graphs by pushing down maximal vertices. II

DOI10.1016/S0012-365X(03)00160-2zbMath1029.05067MaRDI QIDQ1406557

Oliver Pretzel

Publication date: 4 September 2003

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

zbMATH Keywords

latticeorientationflow difference

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20)

Related Items (6)

Decomposition theorem on matchable distributive lattices ⋮ Non-matchable distributive lattices ⋮ Full orientability of graphs with at most one dependent arc ⋮ The \(B\)-model connection and mirror symmetry for Grassmannians ⋮ Source reversal and chip firing on graphs ⋮ Full Orientability of Graphs

Cites Work

• On graphs that can be oriented as diagrams of ordered sets
• On reorienting graphs by pushing down maximal vertices
• Coding distributive lattices with Edge Firing Games.
• Inversions, cuts, and orientations
• Cycle Lengths and Graph Orientations
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On reorienting graphs by pushing down maximal vertices. II