On the longest path in a recursively partitionable graph
A connected graph \(G\) with order \(n \geq 1\) is said to be recursively arbitrarily partitionable (R-AP for short) if either it is isomorphic to \(K_1\), or for every sequence \((n_1, \ldots , n_p)\) of positive integers summing up to \(n\) there exists a partition \((V_1, \ldots , V_p)\) of \(V(G...
Main Author: | Julien Bensmail |
---|---|
Format: | Article |
Language: | English |
Published: |
AGH Univeristy of Science and Technology Press
2013-01-01
|
Series: | Opuscula Mathematica |
Subjects: | |
Online Access: | http://www.opuscula.agh.edu.pl/vol33/4/art/opuscula_math_3334.pdf |
Similar Items
-
Structural Properties of Recursively Partitionable Graphs with Connectivity 2
by: Baudon Olivier, et al.
Published: (2017-02-01) -
Intersections of Longest Paths and Cycles
by: Hippchen, Thomas
Published: (2008) -
A Note on Longest Paths in Circular Arc Graphs
by: Joos Felix
Published: (2015-08-01) -
Intersecting longest paths and longest cycles: A survey
by: Ayesha Shabbir, et al.
Published: (2013-04-01) -
Dense Arbitrarily Partitionable Graphs
by: Kalinowski Rafał, et al.
Published: (2016-02-01)