✦ LIBER ✦

On the Structure of Graphs with Non-Surjective L (2,1)-Labelings

✍ Scribed by Georges, John P.; Mauro, David W.

Book ID: 118198896
Publisher: Society for Industrial and Applied Mathematics
Year: 2005
Tongue: English
Weight: 232 KB
Volume: 19
Category: Article
ISSN: 0895-4801
DOI: 10.1137/s0895480103429800

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Construction of Large Graphs with No Opt

Construction of Large Graphs with No Optimal Surjective L (2,1)-Labelings

✍ Král', Daniel; Skrekovski, Riste; Tancer, Martin 📂 Article 📅 2006 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 147 KB

$L(2,1)$-Labeling of Hamiltonian graphs

$L(2,1)$-Labeling of Hamiltonian graphs with Maximum Degree 3

✍ Kang, Jeong-Hyun 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 246 KB

On the complexity of exact algorithm for

On the complexity of exact algorithm for L (2, 1)-labeling of graphs

✍ Konstanty Junosza-Szaniawski; Paweł Rzążewski 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 160 KB

On the structure of factorizable graphs

✍ L. Lovász 📂 Article 📅 1972 🏛 Akadmiai Kiad 🌐 English ⚖ 1023 KB

1.8. L2-Boundedness of the Cauchy integr

1.8. L2-Boundedness of the Cauchy integral on Lipschitz graphs

✍ A. P. Calderón 📂 Article 📅 1984 🏛 Springer US 🌐 English ⚖ 64 KB

On the structure of graphs with few P4s

✍ Luitpold Babel; Stephan Olariu 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 984 KB

We present new classes of graphs for which the isomorphism problem can be solved in polynomial time. These graphs are characterized by containing -in some local sense -only a small number of induced paths of length three. As it turns out, every such graph has a unique tree representation: the intern