ULD-Lattices and Δ-Bonds

DOI10.1017/S0963548309010001zbMath1194.06002arXiv0807.1217MaRDI QIDQ3552499

Kolja Knauer, Stefan Felsner

Publication date: 22 April 2010

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0807.1217

zbMATH Keywords

flowsedge colouringcover graphsupper locally distributive lattices

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Structure and representation theory of distributive lattices (06D05) Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (9)

Bijective proof of the rationality of the generating series of higher-genus maps ⋮ An algorithm for Berenstein-Kazhdan decoration functions and trails for minuscule representations ⋮ Distributive lattices, polyhedra, and generalized flows ⋮ Blossoming bijection for higher-genus maps ⋮ Convexity in partial cubes: the hull number ⋮ Schnyder decompositions for regular plane graphs and application to drawing ⋮ Lattices and Maximum Flow Algorithms in Planar Graphs ⋮ Mixing Times of Markov Chains of 2-Orientations ⋮ Flip distances between graph orientations

Cites Work

• Chip-firing games on directed graphs
• Chip-firing games on graphs
• Pruning processes and a new characterization of convex geometries
• The theory of convex geometries
• Meet-distributive lattices and the anti-exchange closure
• Excluded-minor characterizations of antimatroids arisen from posets and graph searches.
• Locally atomic upper locally distributive lattices
• Convexity in directed graphs
• Lattices with unique irreducible decompositions
• The Lattice Structure of Flow in Planar Graphs
• Decomposition Theory for Lattices Without Chain Conditions
• Shellable and Cohen-Macaulay Partially Ordered Sets
• Introduction to Greedoids

This page was built for publication: ULD-Lattices and Δ-Bonds