On reorienting graphs by pushing down maximal vertices
From MaRDI portal
Publication:1087553
DOI10.1007/BF00390104zbMath0611.05028OpenAlexW2081357203MaRDI QIDQ1087553
Publication date: 1986
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00390104
Factorials, binomial coefficients, combinatorial functions (05A10) Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20)
Related Items (29)
Sandpile models and lattices: a comprehensive survey ⋮ Toric promotion ⋮ Inversions, cuts, and orientations ⋮ Orientations of chain groups ⋮ On homomorphisms of oriented graphs with respect to the push operation ⋮ On oriented cliques with respect to push operation ⋮ An atlas of limit set dynamics for asynchronous elementary cellular automata ⋮ Cops and robber on oriented graphs with respect to push operation ⋮ $st$-Orientations with Few Transitive Edges ⋮ On the pushable chromatic number of various types of grids ⋮ On reorienting graphs by pushing down maximal vertices. II ⋮ Diagrams, orientations, and varieties ⋮ Pushable chromatic number of graphs with degree constraints ⋮ Non-cover generalized Mycielski, Kneser, and Schrijver graphs ⋮ Toric arrangements associated to graphs ⋮ Full orientability of graphs with at most one dependent arc ⋮ An Ore-type condition for cyclability ⋮ Toric partial orders ⋮ Friends and strangers walking on graphs ⋮ Checkerboard graph monodromies ⋮ Neighborhood unions and cyclability of graphs ⋮ Minimal Penner dilatations on nonorientable surfaces ⋮ Cycle Equivalence of Finite Dynamical Systems Containing Symmetries ⋮ Full Orientability of Graphs ⋮ First-return maps of Birkhoff sections of the geodesic flow ⋮ Coding distributive lattices with Edge Firing Games. ⋮ Characterization of simple edge-firing games. ⋮ Enumerating orientations of ordered sets ⋮ On the complexity of diagram testing
Cites Work
This page was built for publication: On reorienting graphs by pushing down maximal vertices
