Entry Chiba:1989:HCP from jalg.bib
Last update: Sat Oct 14 02:35:45 MDT 2017
Top |
Symbols |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Chiba:1989:HCP,
author = "Norishige Chiba and Takao Nishizeki",
title = "The {Hamiltonian} cycle problem is linear-time
solvable for 4-connected planar graphs",
journal = j-J-ALG,
volume = "10",
number = "2",
pages = "187--211",
month = jun,
year = "1989",
CODEN = "JOALDV",
DOI = "https://doi.org/10.1016/0196-6774(89)90012-6",
ISSN = "0196-6774 (print), 1090-2678 (electronic)",
ISSN-L = "0196-6774",
bibdate = "Tue Dec 11 09:14:52 MST 2012",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jalg.bib",
URL = "http://www.sciencedirect.com/science/article/pii/0196677489900126",
acknowledgement = ack-nhfb,
fjournal = "Journal of Algorithms",
journal-URL = "http://www.sciencedirect.com/science/journal/01966774",
}
Related entries
- Chiba, Norishige,
2(4)317
- cycle,
7(3)382,
8(3)395,
9(2)181,
9(2)276,
9(4)470,
9(4)507,
15(1)61,
15(3)367,
18(2)203,
19(3)333,
19(3)432,
21(1)51,
21(1)102,
21(1)176,
27(1)26,
31(1)249,
33(1)124,
47(2)104,
48(1)239,
54(1)72
- Hamiltonian,
5(3)375,
8(4)503,
9(2)276,
15(3)367,
18(2)203,
18(2)358,
19(3)432,
31(1)249,
36(2)253,
50(2)246
- linear-time,
2(2)198,
8(2)216
- Nishizeki, Takao,
2(4)317,
6(3)393,
7(1)79,
11(1)102,
13(4)606,
20(1)174,
21(3)598,
23(2)359,
37(2)363,
50(1)62
- planar,
2(4)317,
4(2)121,
5(1)60,
5(3)375,
7(2)174,
7(3)382,
8(4)470,
10(1)35,
11(1)102,
11(2)153,
12(1)23,
14(2)258,
15(1)61,
15(2)314,
21(1)51,
21(2)201,
21(3)453,
23(1)51,
23(1)121,
25(1)177,
27(2)269,
28(2)290,
32(2)87,
37(1)189,
37(2)399,
37(2)570,
39(1)68,
42(2)334,
49(2)262,
50(1)62,
52(1)26,
53(2)186
- solvable,
9(1)114
- time, linear-,
2(2)198