Some new good characterizations for directed graphs

DOI10.21136/CPM.1984.118204zbMATH Open0569.05022OpenAlexW3047858020MaRDI QIDQ3686735FDOQ3686735

Authors: Pavel Komárek 

Publication date: 1984

Full work available at URL: https://eudml.org/doc/21570

Recommendations

• On good characterizations for digraphs
• Publication:4863467
• Characterizations for special directed co-graphs
• scientific article; zbMATH DE number 16382
• An algorithmic characterization of total digraphs

zbMATH Keywords

digraphscharacterizationshomomorphism

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Cited In (11)

• Many Facets of Dualities
• Dualities for Constraint Satisfaction Problems
• On the complexity of H-coloring
• Connected obstructions to full graph homomorphisms
• Colorings and girth of oriented planar graphs
• Naturally submodular digraphs and forbidden digraph configurations
• 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
• Homomorphisms to oriented paths
• On good characterizations for digraphs

This page was built for publication: Some new good characterizations for directed graphs

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