Homomorphically Full Oriented Graphs
Homomorphically full graphs are those for which every homomorphic image is isomorphic to a subgraph. We extend the definition of homomorphically full to oriented graphs in two different ways. For the first of these, we show that homomorphically full oriented graphs arise as quasi-transitive orientat...
Saved in:
| Main Authors: | Thomas Bellitto, Christopher Duffy, Gary MacGillivray |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2023-10-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Subjects: | |
| Online Access: | http://dmtcs.episciences.org/9957/pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A Note on Graph Burning of Path Forests
by: Ta Sheng Tan, et al.
Published: (2024-08-01) -
Line game-perfect graphs
by: Stephan Dominique Andres, et al.
Published: (2024-09-01) -
Uniquely hamiltonian graphs for many sets of degrees
by: Gunnar Brinkmann, et al.
Published: (2024-12-01) -
Gallai's Path Decomposition for 2-degenerate Graphs
by: Nevil Anto, et al.
Published: (2023-05-01) -
Bounds on the Twin-Width of Product Graphs
by: William Pettersson, et al.
Published: (2023-06-01)