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
-
Colourings of $(m, n)$-coloured mixed graphs
by: Gary MacGillivray, et al.
Published: (2025-01-01) -
A note on limits of sequences of binary trees
by: Rudolf Grübel
Published: (2023-05-01) -
A Note on Graph Burning of Path Forests
by: Ta Sheng Tan, et al.
Published: (2024-08-01) -
Recognition of chordal graphs and cographs which are Cover-Incomparability graphs
by: Arun Anil, et al.
Published: (2024-11-01) -
An Alternative Proof for the Expected Number of Distinct Consecutive Patterns in a Random Permutation
by: Anant Godbole, et al.
Published: (2024-05-01)