๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Partitioning circulant graphs into isomorphic linear forests

โœ Scribed by Hu Wenfeng; Wang Jianfang

Book ID
110611737
Publisher
Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
1999
Tongue
English
Weight
275 KB
Volume
15
Category
Article
ISSN
0168-9673

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Partitioning a graph into two isomorphic
Partitioning a graph into two isomorphic pieces
โœ Anthony Bonato; Richard Nowakowski ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 137 KB

## Abstract A simple graph __G__ has the neighbourโ€closedโ€coโ€neighbour property, or ncc property, if for all vertices __x__ of __G__, the subgraph induced by the set of neighbours of __x__ is isomorphic to the subgraph induced by the set of nonโ€neighbours of __x__. We present characterizations of g

Spanning subgraphs of graphs partitioned
Spanning subgraphs of graphs partitioned into two isomorphic pieces
โœ Anthony Bonato ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 124 KB

## Abstract A graph has the neighborโ€closedโ€coโ€neighbor, or ncc property, if for each of its vertices __x__, the subgraph induced by the neighbor set of __x__ is isomorphic to the subgraph induced by the closed nonโ€neighbor set of __x__. As proved by Bonato and Nowakowski [5], graphs with the ncc p

Simple planar graph partition into three
Simple planar graph partition into three forests
โœ Roberto Grossi; Elena Lodi ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 796 KB

We describe a simple way of partitioning a planar graph into three edge-disjoint forests in O(n log n) time, where n is the number of its vertices. We can use this partition in Kannan et al.'s graph representation (1992) to label the planar graph vertices so that any two vertices' adjacency can be t