Construction of maximally non-Hamiltonian graphs
| LEADER | caa a22 4500 | ||
|---|---|---|---|
| 001 | 378875388 | ||
| 003 | CHVBK | ||
| 005 | 20180305123419.0 | ||
| 007 | cr unu---uuuuu | ||
| 008 | 161128e20030701xx s 000 0 eng | ||
| 024 | 7 | 0 | |a 10.1515/156939203322385883 |2 doi |
| 035 | |a (NATIONALLICENCE)gruyter-10.1515/156939203322385883 | ||
| 100 | 1 | |a Roldugin |D P. V. | |
| 245 | 1 | 0 | |a Construction of maximally non-Hamiltonian graphs |h [Elektronische Daten] |c [P. V. Roldugin] |
| 520 | 3 | |a In this paper we study the maximally non-Hamiltonian graphs (MNH graphs), that is, the graphs whose property to be non-Hamiltonian ceases to exist as soon as an edge is added. We give rules how to construct MNH graphs which make it possible, starting from MNH graphs with some properties, to get MNH graphs of greater order. | |
| 540 | |a Copyright 2003, Walter de Gruyter | ||
| 773 | 0 | |t Discrete Mathematics and Applications |d Walter de Gruyter |g 13/3(2003-07-01), 277-289 |x 0924-9265 |q 13:3<277 |1 2003 |2 13 |o dma | |
| 856 | 4 | 0 | |u https://doi.org/10.1515/156939203322385883 |q text/html |z Onlinezugriff via DOI |
| 908 | |D 1 |a research article |2 jats | ||
| 950 | |B NATIONALLICENCE |P 856 |E 40 |u https://doi.org/10.1515/156939203322385883 |q text/html |z Onlinezugriff via DOI | ||
| 950 | |B NATIONALLICENCE |P 100 |E 1- |a Roldugin |D P. V. | ||
| 950 | |B NATIONALLICENCE |P 773 |E 0- |t Discrete Mathematics and Applications |d Walter de Gruyter |g 13/3(2003-07-01), 277-289 |x 0924-9265 |q 13:3<277 |1 2003 |2 13 |o dma | ||
| 900 | 7 | |b CC0 |u http://creativecommons.org/publicdomain/zero/1.0 |2 nationallicence | |
| 898 | |a BK010053 |b XK010053 |c XK010000 | ||
| 949 | |B NATIONALLICENCE |F NATIONALLICENCE |b NL-gruyter | ||