Characterizations of two classes of digraphs

DOI10.1016/0012-365X(94)90022-1zbMATH Open0809.05070MaRDI QIDQ1336693FDOQ1336693

Authors: Zygmunt Jackowski 

Publication date: 3 November 1994

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

Recommendations

• scientific article; zbMATH DE number 15401
• scientific article; zbMATH DE number 1156626
• scientific article; zbMATH DE number 3853120
• Interval digraphs: An analogue of interval graphs
• A new characterization of proper interval graphs

zbMATH Keywords

adjacency matrixcharacterizationdigraphastral triple

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• The recognition of the class of indecomposable digraphs under low hemimorphy
• Title not available (Why is that?)
• On the characterization of digraphs with given rank

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

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