✦ LIBER ✦

Construction of class 2 graphs with maximum vertex degree 3

✍ Scribed by Mark K Goldberg

Book ID: 103505041
Publisher: Elsevier Science
Year: 1981
Tongue: English
Weight: 491 KB
Volume: 31
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(81)90030-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Adjacent vertex distinguishing edge-colo

Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree

✍ Weifan Wang; Yiqiao Wang 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 406 KB

Constructing a bipartite graph of maximu

Constructing a bipartite graph of maximum connectivity with prescribed degrees

✍ Asano, Takao 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 328 KB 👁 3 views

d 2,n 2 ) is a bipartite graphical sequence, if there is a bipartite graph G with degrees {D 1 , D 2 } (i.e., G has two independent vertex sets In other words, {D 1 , D 2 } is a bipartite graphical sequence if and only if there is an n 1 1 n 2 matrix of 0's and 1's having d 1j 1 1's in row j 1 and

The NP-completeness of chromatic index i

The NP-completeness of chromatic index in triangle free graphs with maximum vertex of degree 3

✍ Diamantis P. Koreas 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 183 KB

Adjacent vertex-distinguishing edge colo

Adjacent vertex-distinguishing edge coloring of graphs with maximum degree at least five

✍ Hervé Hocquard; Mickaël Montassier 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 237 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

Equitable Total Coloring of Graphs with

Equitable Total Coloring of Graphs with Maximum Degree 3

✍ Wei-Fan Wang 📂 Article 📅 2002 🏛 Springer Japan 🌐 English ⚖ 120 KB