On reorienting graphs by pushing down maximal vertices

DOI10.1007/BF00390104zbMATH Open0611.05028OpenAlexW2081357203MaRDI QIDQ1087553FDOQ1087553

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

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.

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)

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)

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

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)