✦ LIBER ✦

A non-factorial algorithm for canonical numbering of a graph

✍ Scribed by Derek Corneil; Mark Goldberg

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 1005 KB
Volume: 5
Category: Article
ISSN: 0196-6774
DOI: 10.1016/0196-6774(84)90015-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for the reduction of finite

An algorithm for the reduction of finite non-oriented graphs to canonical form

✍ V.L. Arlazarov; I.I. Zuev; A.V. Uskov; I.A. Faradzhev 📂 Article 📅 1974 🏛 Elsevier Science ⚖ 570 KB

A linear algorithm for the domination nu

A linear algorithm for the domination number of a series-parallel graph

✍ Tohru Kikuno; Noriyoshi Yoshida; Yoshiaki Kakuda 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 660 KB

A polynomial algorithm for constructing

A polynomial algorithm for constructing the clique graph of a line graph

✍ Bruce Hedman 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 250 KB

A linear algorithm for the Hamiltonian c

A linear algorithm for the Hamiltonian completion number of the line graph of a cactus

✍ Paolo Detti; Carlo Meloni 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 464 KB

Given a graph G = (V; E); HCN (L(G)) is the minimum number of edges to be added to its line graph L(G) to make L(G) Hamiltonian. This problem is known to be NP-hard for general graphs, whereas a O(|V |) algorithm exists when G is a tree. In this paper a linear algorithm for ÿnding HCN (L(G)) when G

A linear algorithm for the Hamiltonian c

A linear algorithm for the Hamiltonian completion number of the line graph of a cactus

✍ C. Meloni 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 12 KB

A successful concept for measuring non-p

A successful concept for measuring non-planarity of graphs: the crossing number

✍ László A. Székely 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 329 KB