Homomorphically full oriented graphs

DOI10.46298/DMTCS.9957MaRDI QIDQ6599797zbMATH OpenFDO

Authors Thomas Bellitto, Christopher Duffy, Gary MacGillivray

Publication date 6 September 2024

Published in Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

complexitydirected graph homomorphism

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Recommendations

• Homomorphically full graphs
• Homomorphically full reflexive graphs and digraphs
• Homomorphisms to oriented paths
• Homomorphisms to oriented cycles
• The Existence of Homomorphisms to Oriented Cycles

Cites work

• scientific article; zbMATH DE number 3172312 (Why is no real title available?)
• Good and semi-strong colorings of oriented planar graphs
• Graph isomorphism problem
• Graph theory
• Homomorphically full graphs
• Homomorphically full reflexive graphs and digraphs
• Homomorphisms and colourings of oriented graphs: an updated survey
• Homomorphisms of edge-colored graphs and Coxeter groups
• The complexity of deciding whether a graph admits an orientation with fixed weak diameter

Cited in

(1)

• Full-homomorphisms to paths and cycles

This page was built for publication: Homomorphically full oriented graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6599797)