✦ LIBER ✦

Generation of vertex and edge cutsets

✍ Scribed by V.C. Prasad; V. Sankar; K.S. Prakasa Rao

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 591 KB
Volume: 32
Category: Article
ISSN: 0026-2714
DOI: 10.1016/0026-2714(92)90653-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Edge-cutsets in the directed hypercube

✍ Paul L. Mariz; Shahriar Shahriari 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 98 KB

Vertex-distinguishing edge colorings of

Vertex-distinguishing edge colorings of graphs

✍ P. N. Balister; O. M. Riordan; R. H. Schelp 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 136 KB 👁 1 views

Vertex-distinguishing proper edge-colori

Vertex-distinguishing proper edge-colorings

✍ Burris, A. C.; Schelp, R. H. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 146 KB

An edge-coloring is called vertex-distinguishing if every two distinct vertices are incident to different sets of colored edges. The minimum number of colors required for a vertex-distinguishing proper edge-coloring of a simple graph G is denoted by χ s (G). A simple count shows that χ s (G) ≥ max{(

Three-dimensional shape pattern recognit

Three-dimensional shape pattern recognition using vertex classification and vertex-edge graphs

✍ S.H. Chuang; M.R. Henderson 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 890 KB

Edge and vertex intersection of paths in

Edge and vertex intersection of paths in a tree

✍ Martin Charles Golumbic; Robert E. Jamison 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 572 KB

Generalized vertex-rankings of trees

✍ Xiao Zhou; Nobuaki Nagai; Takao Nishizeki 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 622 KB