# Embedding of graphs in two-irregular graphs

M. Axenovich, Z. Füredi

Research output: Contribution to journalArticle

### Abstract

A graph G on n vertices is called two-irregular if there are at most two vertices having the same degree for all possible degrees. We show that every graph with maximal degree at most n/8 - O(n 3/4) can be embedded into a two-irregular graph. We obtain it as a corollary of an algorithmic proof of a result about packing the graphs. This improves the bound of O(n 1/4) given by Faudree et al.

Original language English 75-83 9 Journal of Graph Theory 36 2 Published - 2001

### Fingerprint

Irregular
Graph in graph theory
Packing
Corollary

### Keywords

• Degree sequence
• Embedding
• Irregular
• Packing

### ASJC Scopus subject areas

• Mathematics(all)

### Cite this

Embedding of graphs in two-irregular graphs. / Axenovich, M.; Füredi, Z.

In: Journal of Graph Theory, Vol. 36, No. 2, 2001, p. 75-83.

Research output: Contribution to journalArticle

Axenovich, M. ; Füredi, Z. / Embedding of graphs in two-irregular graphs. In: Journal of Graph Theory. 2001 ; Vol. 36, No. 2. pp. 75-83.
@article{2e10eeeb8ff341179cf801565143587c,
title = "Embedding of graphs in two-irregular graphs",
abstract = "A graph G on n vertices is called two-irregular if there are at most two vertices having the same degree for all possible degrees. We show that every graph with maximal degree at most n/8 - O(n 3/4) can be embedded into a two-irregular graph. We obtain it as a corollary of an algorithmic proof of a result about packing the graphs. This improves the bound of O(n 1/4) given by Faudree et al.",
keywords = "Degree sequence, Embedding, Irregular, Packing",
author = "M. Axenovich and Z. F{\"u}redi",
year = "2001",
language = "English",
volume = "36",
pages = "75--83",
journal = "Journal of Graph Theory",
issn = "0364-9024",
publisher = "Wiley-Liss Inc.",
number = "2",

}

TY - JOUR

T1 - Embedding of graphs in two-irregular graphs

AU - Axenovich, M.

AU - Füredi, Z.

PY - 2001

Y1 - 2001

N2 - A graph G on n vertices is called two-irregular if there are at most two vertices having the same degree for all possible degrees. We show that every graph with maximal degree at most n/8 - O(n 3/4) can be embedded into a two-irregular graph. We obtain it as a corollary of an algorithmic proof of a result about packing the graphs. This improves the bound of O(n 1/4) given by Faudree et al.

AB - A graph G on n vertices is called two-irregular if there are at most two vertices having the same degree for all possible degrees. We show that every graph with maximal degree at most n/8 - O(n 3/4) can be embedded into a two-irregular graph. We obtain it as a corollary of an algorithmic proof of a result about packing the graphs. This improves the bound of O(n 1/4) given by Faudree et al.

KW - Degree sequence

KW - Embedding

KW - Irregular

KW - Packing

UR - http://www.scopus.com/inward/record.url?scp=25144487331&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=25144487331&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:25144487331

VL - 36

SP - 75

EP - 83

JO - Journal of Graph Theory

JF - Journal of Graph Theory

SN - 0364-9024

IS - 2

ER -