Homomorphically full oriented graphs

DOI10.46298/DMTCS.9957zbMATH Open1546.05067MaRDI QIDQ6599797FDOQ6599797

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)

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)

Cites Work

• Graph theory
• Good and semi-strong colorings of oriented planar graphs
• Homomorphisms and colourings of oriented graphs: an updated survey
• The complexity of deciding whether a graph admits an orientation with fixed weak diameter
• Title not available (Why is that?)
• Graph isomorphism problem
• Homomorphically full reflexive graphs and digraphs
• Homomorphisms of edge-colored graphs and Coxeter groups
• Homomorphically full graphs

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)