Structural and complexity aspects of line systems of graphs

DOI10.1007/978-3-642-17517-6_16MaRDI QIDQ3060730zbMATH OpenOpenAlexDBLPWikidataFDO

Authors

Publication date 9 December 2010

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-17517-6_16

Mathematics Subject Classification ID

Distance in graphs (05C12) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Universal lines in graphs
• The \({l_1}\)-embeddability of trees, unicyclic graphs and their line graphs
• Combinatorial theorems about embedding trees on the real line
• scientific article; zbMATH DE number 4012654
• The system of abstract connected subgraphs of a linear graph

Cited in

(6)

• Structural properties of the line-graphs associated to directed networks
• Towards a de Bruijn-Erdős theorem in the \(L_1\)-metric
• Universal lines in graphs
• Enumerating linear systems on graphs
• Systematic generation of linear graphs - check and extension of the list of Uhlenbeck and Ford
• Structural properties and tractability results for linear synteny

This page was built for publication: Structural and complexity aspects of line systems of graphs

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