On reorienting graphs by pushing down maximal vertices (Q1087553)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On reorienting graphs by pushing down maximal vertices |
scientific article; zbMATH DE number 3987306
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On reorienting graphs by pushing down maximal vertices |
scientific article; zbMATH DE number 3987306 |
Statements
On reorienting graphs by pushing down maximal vertices (English)
0 references
1986
0 references
The operation of pushing down elements in the diagram of a finite ordered set introduced by Mosesian in 1972 is studied in this paper. Necessary and sufficient conditions are proved which answer the following questions: which orientations of the underlying graph can be obtained from a given orientation by pushing down and which sets of vertices can become the sets of maximal elements in such orientations. These results are extended to cover also all induced subgraphs and arbitrary orientations of a finite graph.
0 references
pushing down
0 references
diagram
0 references
finite ordered set
0 references
orientations
0 references
0.8142389059066772
0 references
0.8142389059066772
0 references
0.784616231918335
0 references
