Duality pairs and homomorphisms to oriented and unoriented cycles

DOI10.37236/9747zbMath1470.05117arXiv2003.05605MaRDI QIDQ2048544

Santiago Guzmán-Pro, César Hernández-Cruz

Publication date: 6 August 2021

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2003.05605

zbMATH Keywords

oriented path; undirected cycle

Mathematics Subject Classification ID

05C75: Structural characterization of families of graphs

05C20: Directed graphs (digraphs), tournaments

05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)

Related Items

Oriented expressions of graph properties

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Images of rigid digraphs
• On multiplicative graphs and the product conjecture
• Homomorphisms to oriented cycles
• Duality theorems for finite structures (characterising gaps and good characterisations)
• Incidence matrices and interval graphs
• A dualistic approach to bounding the chromatic number of a graph
• On unavoidable digraphs in orientations of graphs
• A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs
• The Existence of Homomorphisms to Oriented Cycles
• A Polynomial Algorithm for Homomorphisms to Oriented Cycles
• Short Answers to Exponentially Long Questions: Extremal Aspects of Homomorphism Duality
• Nombre chromatique et plus longs chemins d'un graphe
• Zur algebraischen Begründung der Graphentheorie. I