Characterizations of two classes of digraphs

DOI10.1016/0012-365X(94)90022-1zbMath0809.05070MaRDI QIDQ1336693

Zygmunt Jackowski

Publication date: 3 November 1994

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

zbMATH Keywords

digraphcharacterizationadjacency matrixastral triple

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Domination, independent domination, and duality in strongly chordal graphs
• A new characterization of proper interval graphs
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• A structure theorem for the consecutive 1's property
• Betweenness, orders and interval graphs
• Representation of a finite graph by a set of intervals on the real line
• Doubly Lexical Orderings of Matrices
• Three Partition Refinement Algorithms

This page was built for publication: Characterizations of two classes of digraphs