Isometric path partition number of honeycomb derived networks

Isometric Path Partition Number of Butterfly Network and X–Trees

IOP Conference Series Materials Science and Engineering ◽

10.1088/1757-899x/912/6/062052 ◽

2020 ◽

Vol 912 ◽

pp. 062052

Author(s):

R Prabha ◽

R Kalaiyarasi

Keyword(s):

Partition Number ◽

Butterfly Network ◽

Path Partition

Download Full-text

Path partition number in tough graphs

Discrete Mathematics ◽

10.1016/s0012-365x(96)00063-5 ◽

1997 ◽

Vol 164 (1-3) ◽

pp. 291-294 ◽

Cited By ~ 1

Author(s):

Hoa Vu Dinh

Keyword(s):

Partition Number ◽

Path Partition

Download Full-text

The conjunction of the linear arboricity conjecture and Lovász's path partition theorem

Discrete Mathematics ◽

10.1016/j.disc.2021.112434 ◽

2021 ◽

Vol 344 (8) ◽

pp. 112434

Author(s):

Guantao Chen ◽

Yanli Hao

Keyword(s):

Partition Theorem ◽

Linear Arboricity ◽

Path Partition

Download Full-text

An efficient algorithm for the minimum L2 path partition

Operations Research Letters ◽

10.1016/j.orl.2007.01.004 ◽

2007 ◽

Author(s):

B YEWU ◽

P HO

Keyword(s):

Efficient Algorithm ◽

Path Partition

Download Full-text

The Path Partition Conjecture

Graph Theory - Problem Books in Mathematics ◽

10.1007/978-3-319-97686-0_10 ◽

2018 ◽

pp. 101-113

Author(s):

Marietjie Frick ◽

Jean E. Dunbar

Keyword(s):

Path Partition

Download Full-text

Clique coverings of graphs V: maximal-clique partitions

Bulletin of the Australian Mathematical Society ◽

10.1017/s0004972700005414 ◽

1982 ◽

Vol 25 (3) ◽

pp. 337-356 ◽

Cited By ~ 5

Author(s):

N.J. Pullman ◽

H. Shank ◽

W.D. Wallis

Keyword(s):

Maximal Clique ◽

Maximal Degree ◽

Open Problems ◽

Partition Number

A maximal-clique partition of a graph G is a way of covering G with maximal complete subgraphs, such that every edge belongs to exactly one of the subgraphs. If G has a maximal-clique partition, the maximal-clique partition number of G is the smallest cardinality of such partitions. In this paper the existence of maximal-clique partitions is discussed – for example, we explicitly describe all graphs with maximal degree at most four which have maximal-clique partitions - and discuss the maximal-clique partition number and its relationship to other clique covering and partition numbers. The number of different maximal-clique partitions of a given graph is also discussed. Several open problems are presented.

Download Full-text