Entry Picouleau:1994:CHC from tcs1990.bib
Last update: Wed Sep 26 02:11:46 MDT 2018
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{Picouleau:1994:CHC,
author = "C. Picouleau",
title = "Complexity of the {Hamiltonian} cycle in regular graph
problem",
journal = j-THEOR-COMP-SCI,
volume = "131",
number = "2",
pages = "463--473",
day = "12",
month = sep,
year = "1994",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:18:23 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1994&volume=131&issue=2;
http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1994&volume=131&issue=2&aid=1639",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "LITP, Universit{\'e} Pierre et Marie Curie, Paris,
France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "3-regular graph; complexity; computational complexity;
graph theory; Hamiltonian cycle; k-regular graph;
NP-complete; regular graph problem",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- complete, NP-,
80(2)203,
81(1)49,
81(1)65,
81(1)155,
81(2)257,
84(1)23,
84(2)179,
85(1)205,
92(1)145,
99(1)157,
104(2)185,
104(2)285,
108(2)365,
119(2)293,
120(2)311,
129(1)95,
129(2)309,
131(2)361,
131(2)449,
132(1)229,
133(1)85,
133(1)95,
133(2)421,
134(1)209,
134(2)263,
134(2)287,
134(2)387,
135(1)155,
135(2)361,
120(2)311,
135(1)155
- cycle,
71(3)419,
84(2)179,
106(2)265,
117(1)3,
117(1)243,
119(2)331,
127(2)395,
132(1)1
- Hamiltonian,
71(3)419,
132(1)347
- k-regular,
98(2)163
- NP-complete,
80(2)203,
81(1)49,
81(1)65,
81(1)155,
81(2)257,
84(1)23,
84(2)179,
85(1)205,
92(1)145,
99(1)157,
104(2)185,
104(2)285,
108(2)365,
119(2)293,
120(2)311,
129(1)95,
129(2)309,
131(2)361,
131(2)449,
132(1)229,
133(1)85,
133(1)95,
133(2)421,
134(1)209,
134(2)263,
134(2)287,
134(2)387,
135(1)155,
135(2)361
- regular,
70(2)213,
73(1)91,
73(3)329,
74(3)341,
75(1)157,
76(2)261,
76(2)273,
76(2)323,
77(1)97,
79(1)25,
81(2)305,
82(1)19,
83(2)287,
84(2)293,
85(1)117,
86(2)233,
87(1)43,
87(2)315,
88(1)139,
88(2)287,
88(2)351,
91(1)85,
91(1)101,
96(2)285,
97(2)217,
98(2)163,
99(1)79,
100(1)67,
101(1)133,
103(2)191,
103(2)409,
104(2)161,
106(1)61,
106(1)119,
108(1)17,
108(2)393,
112(2)187,
112(2)413,
115(2)261,
116(2)305,
116(2)373,
119(2)267,
120(2)197,
124(2)329,
125(2)315,
125(2)361,
127(2)287,
129(1)187,
131(2)311,
132(1)71,
133(1)49,
134(1)107,
134(1)119,
134(1)175,
134(1)189,
134(1)253,
134(2)537
- regular, k-,
98(2)163