Some new good characterizations for directed graphs
From MaRDI portal
Publication:3686735
DOI10.21136/cpm.1984.118204zbMath0569.05022OpenAlexW3047858020MaRDI QIDQ3686735
Publication date: 1984
Full work available at URL: https://eudml.org/doc/21570
Related Items (9)
Homomorphisms to oriented paths ⋮ On the complexity of H-coloring ⋮ Colorings and girth of oriented planar graphs ⋮ Many Facets of Dualities ⋮ Connected obstructions to full graph homomorphisms ⋮ Dualities in full homomorphisms ⋮ A surprising permanence of old motivations (a not-so-rigid story) ⋮ A note on maxflow-mincut and homomorphic equivalence in matroids ⋮ Dualities for Constraint Satisfaction Problems
This page was built for publication: Some new good characterizations for directed graphs
