On the longest path in a recursively partitionable graph

DOI10.7494/OPMATH.2013.33.4.631zbMath1276.05064OpenAlexW2038526500MaRDI QIDQ2864638

Julien Bensmail

Publication date: 26 November 2013

Published in: Opuscula Mathematica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7494/opmath.2013.33.4.631

zbMATH Keywords

longest pathrecursively partitionable graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)

Related Items (1)

Structural properties of recursively partitionable graphs with connectivity 2

This page was built for publication: On the longest path in a recursively partitionable graph