On reorienting graphs by pushing down maximal vertices

DOI10.1007/BF00390104MaRDI QIDQ1087553zbMATH OpenOpenAlexFDO

Authors Oliver Pretzel

Publication date 1986

Published in Order (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00390104

zbMATH Keywords

diagramorientationsfinite ordered setpushing down

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3957181
• On reorienting graphs by pushing down maximal vertices. II
• On oriented cliques with respect to push operation
• scientific article; zbMATH DE number 17787
• Re-orienting tournaments by pushing vertices.

Cites work

• A Theorem on n-Coloring the Points of a Linear Graph
• On graphs that can be oriented as diagrams of ordered sets

Cited in

(33)

• On reorienting graphs by pushing down maximal vertices. II
• Sandpile models and lattices: a comprehensive survey
• Minimal Penner dilatations on nonorientable surfaces
• On the pushable chromatic number of various types of grids
• On homomorphisms of oriented graphs with respect to the push operation
• scientific article; zbMATH DE number 17787 (Why is no real title available?)
• An atlas of limit set dynamics for asynchronous elementary cellular automata
• Toric promotion
• scientific article; zbMATH DE number 3957181 (Why is no real title available?)
• Toric arrangements associated to graphs
• Checkerboard graph monodromies
• Size of downsets in the pushing order and a problem of Berlekamp
• Diagrams, orientations, and varieties
• On the diameters of friends-and-strangers graphs
• Friends and strangers walking on graphs
• On the complexity of diagram testing
• Characterization of simple edge-firing games.
• Non-cover generalized Mycielski, Kneser, and Schrijver graphs
• On oriented cliques with respect to push operation
• Enumerating orientations of ordered sets
• Pushable chromatic number of graphs with degree constraints
• Inversions, cuts, and orientations
• An Ore-type condition for cyclability
• $st$-Orientations with Few Transitive Edges
• Toric partial orders
• Neighborhood unions and cyclability of graphs
• Full orientability of graphs with at most one dependent arc
• Orientations of chain groups
• Cycle equivalence of finite dynamical systems containing symmetries
• Cops and robber on oriented graphs with respect to push operation
• Full orientability of graphs
• Coding distributive lattices with Edge Firing Games.
• First-return maps of Birkhoff sections of the geodesic flow

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

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