1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
|
% !TeX encoding = windows-1251
@BOOK{Bogomolov_1997,
author = {А. М. Богомолов and В. Н. Салий},
title = {Алгебраические основы теории дискретных систем},
publisher = {Наука},
address = {Москва},
year = {1997},
language = {russian},
}
@article{bigalke1979hamiltonsche,
title={{\"U}ber hamiltonsche kreise und unabh{\"a}ngige ecken in graphen},
author={Bigalke, A and Jung, HA},
journal={Monatshefte f{\"u}r Mathematik},
volume={88},
number={3},
pages={195--210},
year={1979},
publisher={Springer},
language = {deutsch},
}
@article{dirac1952some,
title={Some theorems on abstract graphs},
author={Dirac, Gabriel Andrew},
journal={Proceedings of the London Mathematical Society},
volume={3},
number={1},
pages={69--81},
year={1952},
publisher={Oxford Academic}
}
@article{bondy1976method,
title={A method in graph theory},
author={Bondy, J Adrian and Chv{\'a}tal, Vasek},
journal={Discrete Mathematics},
volume={15},
number={2},
pages={111--135},
year={1976},
publisher={Elsevier}
}
@article{mckay2014practical,
title={Practical graph isomorphism, II},
author={McKay, Brendan D and Piperno, Adolfo},
journal={Journal of symbolic computation},
volume={60},
pages={94--112},
year={2014},
publisher={Elsevier}
}
@article{bauer1995long,
title={Long cycles in graphs with prescribed toughness and minimum degree},
author={Bauer, Douglas and Broersma, Haitze J and van den Heuvel, Jan and Veldman, Henk Jan},
journal={Discrete mathematics},
volume={141},
number={1-3},
pages={1--10},
year={1995},
publisher={Elsevier}
}
@article{bauer2006toughness,
title={Toughness in graphs--a survey},
author={Bauer, Douglas and Broersma, Hajo and Schmeichel, Edward},
journal={Graphs and Combinatorics},
volume={22},
number={1},
pages={1--35},
year={2006},
publisher={Springer}
}
@article{ore1960note,
title={A note on hamiltonian circuits},
author={Ore, Oystein},
journal={American Mathematical Monthly},
volume={67},
pages={55},
year={1960}
}
@article{posa1963circuits,
title={On the circuits of finite graphs},
author={P{\'o}sa, Lajos},
journal={Magyar Tud. Akad. Mat. Kutat{\'o} Int. K{\"o}zl},
volume={8},
pages={355--361},
year={1963}
}
@article{abrosimov2016graphs,
title={Практические задания по графам},
author={Абросимов, МБ and Долгов, АА},
journal={Саратов: Научная книга.--2008},
year={2016}
}
@book{harary_1973,
title={Теория графов},
author={Харари, Фрэнк},
year={1973},
address={Москва},
publisher={Издательство <<Мир>>}
}
@book{graph6,
title={Description of graph6, sparse6 and digraph6 encodings [{Э}лектронный ресурс]},
note={URL:~\url{http://users.cecs.anu.edu.au/~bdm/data/formats.txt} (Дата обращения 20.04.2023). Загл. с экр. Яз. англ.}},
}
@inproceedings{hopcroft1974linear,
title={Linear time algorithm for isomorphism of planar graphs (preliminary report)},
author={Hopcroft, John E and Wong, Jin-Kue},
booktitle={Proceedings of the sixth annual ACM symposium on Theory of computing},
pages={172--184},
year={1974}
}
@article{hopcroft1974efficient,
title={Efficient planarity testing},
author={Hopcroft, John and Tarjan, Robert},
journal={Journal of the ACM (JACM)},
volume={21},
number={4},
pages={549--568},
year={1974},
publisher={ACM New York, NY, USA}
}
@article{gould2003advances,
title={Advances on the Hamiltonian problem--a survey},
author={Gould, Ronald J},
journal={Graphs and Combinatorics},
volume={19},
number={1},
pages={7--52},
year={2003},
publisher={Springer}
}
|
