Pages that link to "Item:Q1061751"
From MaRDI portal
The following pages link to On graphs that can be oriented as diagrams of ordered sets (Q1061751):
Displaying 17 items.
- Diagrams, orientations, and varieties (Q911621) (← links)
- Non-cover generalized Mycielski, Kneser, and Schrijver graphs (Q942096) (← links)
- Full orientability of graphs with at most one dependent arc (Q967346) (← links)
- On reorienting graphs by pushing down maximal vertices (Q1087553) (← links)
- A non-covering graph of girth six (Q1106240) (← links)
- Balanced graphs and noncovering graphs (Q1176731) (← links)
- On the complexity of diagram testing (Q1319079) (← links)
- On reorienting graphs by pushing down maximal vertices. II (Q1406557) (← links)
- Neighborhood unions and cyclability of graphs (Q1827838) (← links)
- Characterization of simple edge-firing games. (Q1853145) (← links)
- Pushable chromatic number of graphs with degree constraints (Q2219941) (← links)
- On homomorphisms of oriented graphs with respect to the push operation (Q2397542) (← links)
- On oriented cliques with respect to push operation (Q2410221) (← links)
- Inversions, cuts, and orientations (Q2640623) (← links)
- Full Orientability of Graphs (Q2851537) (← links)
- Word-Representable Graphs: a Survey (Q4558287) (← links)
- An Ore-type condition for cyclability (Q5949032) (← links)
