Path Partitions of Almost Regular Graphs

Colton Magnant; Hua Wang; Shuai Yuan

Path Partitions of Almost Regular Graphs

Colton Magnant, Hua Wang, Shuai Yuan

Mathematical Sciences

Research output: Contribution to journal › Article › peer-review

3 Scopus citations

Abstract

The path partition number of a graph is the minimum number of paths required to partition the vertices. We consider upper bounds on the path partition number under minimum and maximum degree assumptions.

Original language	American English
Journal	Australasian Journal of Combinatorics
Volume	64
State	Published - Feb 1 2016

Keywords

Partition
Path partition
Path partition number
Paths

DC Disciplines

Education
Mathematics

Access to Document

Path Partitions of Almost Regular GraphsFinal published version, 137 KBLicense: Unspecified

Cite this

@article{94447488d1dd4769a7757ccab539a94b,

title = "Path Partitions of Almost Regular Graphs",

abstract = "The path partition number of a graph is the minimum number of paths required to partition the vertices. We consider upper bounds on the path partition number under minimum and maximum degree assumptions.",

keywords = "Partition, Path partition, Path partition number, Paths",

author = "Colton Magnant and Hua Wang and Shuai Yuan",

year = "2016",

month = feb,

day = "1",

language = "American English",

volume = "64",

journal = "Australasian Journal of Combinatorics",

issn = "1034-4942",

publisher = "University of Queensland Press",

}

TY - JOUR

T1 - Path Partitions of Almost Regular Graphs

AU - Magnant, Colton

AU - Wang, Hua

AU - Yuan, Shuai

PY - 2016/2/1

Y1 - 2016/2/1

N2 - The path partition number of a graph is the minimum number of paths required to partition the vertices. We consider upper bounds on the path partition number under minimum and maximum degree assumptions.

AB - The path partition number of a graph is the minimum number of paths required to partition the vertices. We consider upper bounds on the path partition number under minimum and maximum degree assumptions.

KW - Partition

KW - Path partition

KW - Path partition number

KW - Paths

UR - https://digitalcommons.georgiasouthern.edu/math-sci-facpubs/352

M3 - Article

SN - 1034-4942

VL - 64

JO - Australasian Journal of Combinatorics

JF - Australasian Journal of Combinatorics

ER -

Path Partitions of Almost Regular Graphs

Abstract

Keywords

DC Disciplines

Access to Document

Other files and links

Fingerprint

Cite this