A characterization problem on underlying graphs of line digraphs

DOI10.1016/J.DAM.2004.06.012MaRDI QIDQ1765379zbMATH OpenOpenAlexFDO

Authors Amine El Sahili

Publication date 23 February 2005

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

Full work available at URL https://doi.org/10.1016/j.dam.2004.06.012

zbMATH Keywords

Line digraphUnderlying graph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Recommendations

• scientific article; zbMATH DE number 4156491
• scientific article; zbMATH DE number 4200231
• scientific article; zbMATH DE number 3906540
• A survey of line digraphs and generalizations
• A characterization of partial directed line graphs
• Characterizing \(N_+\)-perfect line graphs
• n-dimensional line digraphs
• scientific article; zbMATH DE number 3906545
• Characterization of topologies of some digraphs

Cites work

• scientific article; zbMATH DE number 3480514 (Why is no real title available?)
• scientific article; zbMATH DE number 3286813 (Why is no real title available?)
• A note on line digraphs and the directed max-cut problem

Cited in

(9)

• The recognition problem for line bigraphs
• A survey of line digraphs and generalizations
• Functional graphs
• scientific article; zbMATH DE number 4023327 (Why is no real title available?)
• The underlying graph of a line digraph
• A characterization of partial directed line graphs
• n-dimensional line digraphs
• Characterizations of the family of all generalized line graphs-finite and infinite- and classification of the family of all graphs whose least eigenvalues \ge - 2
• On the characterization of digraphs with given rank

This page was built for publication: A characterization problem on underlying graphs of line digraphs

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