A short update on equipackable graphs

Preben D. Vestergaard

A short update on equipackable graphs

Preben D. Vestergaard

Institut for Matematiske Fag

Publikation: Bog/antologi/afhandling/rapport › Rapport › Forskning

521 Downloads (Pure)

Abstract

A graph is called equipackable if every maximal packing in it is also maximum. This generalizes randomly packable graphs. We survey known results both on randomly packable graphs and on equipackable graphs. As a new result is given a characterization of P₃-equipackable graphs with all valencies at least two.

Originalsprog	Engelsk

Udgivelsessted	Aalborg University
Forlag	Department of Mathematical Sciences, Aalborg University
Antal sider	10
Status	Udgivet - 2007

Navn	Research Report Series
Nummer	R-2007-06
ISSN	1399-2503

Adgang til dokumentet

R-2007-06Forlagets udgivne version, 245 KB

AUB Link

Søg efter materialet i Aalborg Universitetsbiblioteks søgemaskine

Citationsformater

@book{b275fc70bda211db86ee000ea68e967b,

title = "A short update on equipackable graphs",

abstract = "A graph is called equipackable if every maximal packing in it is also maximum. This generalizes randomly packable graphs. We survey known results both on randomly packable graphs and on equipackable graphs. As a new result is given a characterization of P3-equipackable graphs with all valencies at least two.",

author = "Vestergaard, \{Preben D.\}",

year = "2007",

language = "English",

series = "Research Report Series",

number = "R-2007-06",

publisher = "Department of Mathematical Sciences, Aalborg University",

}

TY - RPRT

T1 - A short update on equipackable graphs

AU - Vestergaard, Preben D.

PY - 2007

Y1 - 2007

N2 - A graph is called equipackable if every maximal packing in it is also maximum. This generalizes randomly packable graphs. We survey known results both on randomly packable graphs and on equipackable graphs. As a new result is given a characterization of P3-equipackable graphs with all valencies at least two.

AB - A graph is called equipackable if every maximal packing in it is also maximum. This generalizes randomly packable graphs. We survey known results both on randomly packable graphs and on equipackable graphs. As a new result is given a characterization of P3-equipackable graphs with all valencies at least two.

M3 - Report

T3 - Research Report Series

BT - A short update on equipackable graphs

PB - Department of Mathematical Sciences, Aalborg University

CY - Aalborg University

ER -

A short update on equipackable graphs

Abstract

Adgang til dokumentet

AUB Link

Fingeraftryk

Citationsformater