All P3-equipackable graphs

Bert Randerath; Preben D. Vestergaard

doi:10.1016/j.disc.2008.09.018

All P₃-equipackable graphs

Bert Randerath, Preben D. Vestergaard

Department of Mathematical Sciences

Research output: Contribution to journal › Journal article › Research › peer-review

10 Citations (Scopus)

Abstract

A graph G is P₃-equipackable if any sequence of successive removals of edge-disjoint copies of P₃from G always terminates with a graph having at most one edge. All P₃-equipackable graphs are characterised. They belong to a small number of families listed here.

Original language	English
Journal	Discrete Mathematics
Volume	310
Pages (from-to)	355-359
Number of pages	5
ISSN	0012-365X
DOIs	https://doi.org/10.1016/j.disc.2008.09.018
Publication status	Published - 2010

Access to Document

10.1016/j.disc.2008.09.018

AUB Link

Search for the material in Aalborg University Library's search engine

Cite this

@article{a2217520df4611deabf1000ea68e967b,

title = "All P3-equipackable graphs",

abstract = "A graph G is P3-equipackable if any sequence of successive removals of edge-disjoint copies of P3 from G always terminates with a graph having at most one edge. All P3-equipackable graphs are characterised. They belong to a small number of families listed here.",

author = "Bert Randerath and Vestergaard, {Preben D.}",

year = "2010",

doi = "10.1016/j.disc.2008.09.018",

language = "English",

volume = "310",

pages = "355--359",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

}

TY - JOUR

T1 - All P3-equipackable graphs

AU - Randerath, Bert

AU - Vestergaard, Preben D.

PY - 2010

Y1 - 2010

N2 - A graph G is P3-equipackable if any sequence of successive removals of edge-disjoint copies of P3 from G always terminates with a graph having at most one edge. All P3-equipackable graphs are characterised. They belong to a small number of families listed here.

AB - A graph G is P3-equipackable if any sequence of successive removals of edge-disjoint copies of P3 from G always terminates with a graph having at most one edge. All P3-equipackable graphs are characterised. They belong to a small number of families listed here.

U2 - 10.1016/j.disc.2008.09.018

DO - 10.1016/j.disc.2008.09.018

M3 - Journal article

SN - 0012-365X

VL - 310

SP - 355

EP - 359

JO - Discrete Mathematics

JF - Discrete Mathematics

ER -