On edge transitivity of directed graphs

DOI10.1016/0012-365X(93)E0182-4zbMath0824.05055MaRDI QIDQ1894773

Jayme Luiz Szwarcfiter

Publication date: 9 November 1995

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

dimensioncharacterizationdirected graphsacyclic orientationinterval graphcircle graphsedge transitivitylocal comparability graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reconnaissance des graphes de cordes
• Reducing prime graphs and recognizing circle graphs
• Complexity of diagrams
• Betweenness, orders and interval graphs
• The Complexity of the Partial Order Dimension Problem
• The Complexity of Enumeration and Reliability Problems
• Dimension transitiv orientierbarer graphen
• Orientations of circle graphs
• The Dimension of a Comparability Graph
• Recognizing circle graphs in polynomial time
• On cliques in graphs

This page was built for publication: On edge transitivity of directed graphs