Structural and Complexity Aspects of Line Systems of Graphs

DOI10.1007/978-3-642-17517-6_16zbMath1311.05191DBLPconf/isaac/JirasekK10OpenAlexW1596176126WikidataQ62048096 ScholiaQ62048096MaRDI QIDQ3060730

No author found.

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

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

Related Items (2)

Universal lines in graphs ⋮ Towards a de Bruijn-Erdős theorem in the \(L_1\)-metric

This page was built for publication: Structural and Complexity Aspects of Line Systems of Graphs