On good characterizations for digraphs

DOI10.21136/CPM.1986.118289zbMATH Open0609.05040OpenAlexW3047909647MaRDI QIDQ3749079FDOQ3749079

Authors: Pavel Komárek 

Publication date: 1986

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

Recommendations

• Some new good characterizations for directed graphs
• Homomorphisms, representations and characteristic polynomials of digraphs
• Multiplicativity of acyclic digraphs
• Images of rigid digraphs
• Characterizing homogenous digraphs

zbMATH Keywords

digraphsdirected graphshomomorphism

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Cited In (5)

• Some new good characterizations for directed graphs
• Digraph categories and line digraph functors
• A Divergence-like Characterization of Admissible Functions on Digraphs: A Combinatorial Proof
• Images of rigid digraphs
• On the characterization of digraphs with given rank

This page was built for publication: On good characterizations for digraphs

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