Characterizing homogenous digraphs

MaRDI QIDQ5298915zbMATH OpenFDO

Authors Jing Huang

Publication date 25 June 2013

zbMATH Keywords

acyclic digraphsround digraphssymmetric digraphstournaments

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Recommendations

• Homogeneous 2-partite digraphs
• Set-homogeneous directed graphs
• Locally-finite connected-homogeneous digraphs
• On detour homogeneous digraphs
• On the complete digraphs which are simply disconnected

Cited in

(8)

• On detour homogeneous digraphs
• On the complete digraphs which are simply disconnected
• Homogeneous 2-partite digraphs
• Impartial digraphs
• On good characterizations for digraphs
• Set-homogeneous directed graphs
• Homomorphically full reflexive graphs and digraphs
• Descendant-homogeneous digraphs

This page was built for publication: Characterizing homogenous digraphs

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