Graphs Theory

Graphs Theory
PDF mwlib. . http://code.pediapress.com/

.
PDF generated at: Sat, 22 Mar 2014 02:19:43 UTC

() 1
7
10
11
12
Graphviz 21
Haus vom Nikolaus 23
25
27
29
33
35
36
( ) 39
k- 41
- 42
( ) 43
45
45
, () 47
49
49
50
51
53
54
56
57
63
66
68
72
74
77
80
82
84
88
92
95
97
99
103
104
105
107
110
113
114
116
119
121
124
125
128
131
132
133
- 134
- 136
138
140
142
143
( ) 146
149
- 152
- 154
( ) 156
157
( ) 158
164
( ) 167
168
177
178
179
184
187
- 187
189
192
194
197
( ) 200
( ) 202
206
( ) 207
209
211
212
( ) 214
216
217
220
( ) 221
223
224
227
231
233
234
237
238
240
242
() 253
261
265
( ) 266
269
271
273
275
280
281
284
286
288
( ) 290
291
292
( ) 293
295
297
299
300
304
305
308
310
311
313
313
316
317
318
323
329
331
331
333
335
335
336
338
( ) 346
347
351
k- 365
- 366
368
( ) 372
374
374
375
377
378
380
383
386
388
( ) 390
393
395
397
401
408
( ) 409
412
415
() 420
425
426
428
430
432
432
434
435
438
444
( ) 445
448
451
454
( ) 456
( ) 457
- 463
464
466
( ) 467
( ) 468
470
472
, 477

484
() 1
()

( ).
, , ,
.
,
.
,
, . ,
(),
, ( ) (.
).

.
.
.

,
, :
;
(
) , .
( , , )
. ,
, ( - )
. ,
.
, ,
.
( ) . ,
, . .
() 2
, .
, .
, , .
( ).
, ; (
), .

( )
, :
,
() ,
.
,
, . ,
.

, ,
. , ,
, .
.

,
, :
,
,
. .
.

, (
) .
. ( ,
).
( )
, .
, . (
) . ,
, , .
, .
() 3
( ) , ; ,
. , :
, , , .
.
, ( ),
(-), ( ).
.
, ,
, , ,
. ,
.
, .
G ( )
. ,

, .

:
, , .
, ,
.
, .
, (, ) .
, ,
.
k-, , , , ,
, .
,
.
, .
, ,
.
, .
:
k-
k-

.
, , (
, .), ( ),
( ) ( ).
:
() ;
() 4
;
,
;
( ).
, ;
, ;
.
:
.
.

, , .
, - - ( ).
, .
;
;
( ).

, .
- - :
1
, ,
1,
,
0
( )
( ) ,
.
() 5

, ,
.

,
, :
DOT ()
GraphML
Trivial Graph Format
GML
GXL
XGMML
DGML

:
ILOG
GoView
Lassalle AddFlow
LEDA ( [1]; ).
:
igraph [2] ( )
Boost Graph Library ( ).

:
Graphviz (Eclipse Public License)
LION Graph Visualizer [3].
[4] , (GNU LGPL;
Windows?).
Gephi [5] (GNU GPL, CDDL).
GraphX library for .NET [6] open-source .NET Windows
. WPF 4.0.
() 6

. . .: , 1968. 336. http://eqworld.ipmnet.ru/ru/library/books/Ore1965ru.djvu
.. http://dfgm.math.msu.su/files/0ngit/
oshemkov/00ngit.pdf
. . . .: , 1977. 208. http://eqworld.ipmnet.ru/ru/library/
books/Uilson1977ru.djvu
. . .: , 1973. http://eqworld.ipmnet.ru/ru/library/books/Harari1973ru.djvu
. . . VI. // : =
INTRODUCTION TO ALGORITHMS. 2- . .: , 2006. .1296.
ISBN 0-07-013151-1
. ., . . . .:
- , 1997. ISBN 5-02-015033-9
. ., .. : , .
.: -, 2003. .1104. ISBN 5-94157-184-4
. ., . ., . ., . . . .: ,
1990. 384. (.2, . .: , 2009. 392 .)
. . Maple. .: , 2007. 168 c. http://vuz.exponenta.ru/PDF/book/
GrMaple.pdf http://eqworld.ipmnet.ru/ru/library/books/Kirsanov2007ru.pdf

[1] http:/ / www. algorithmic-solutions. com/ leda/ ledak/ index. htm
[2] http:/ / igraph. sourceforge. net
[3] http:/ / lion. disi. unitn. it/ intelligent-optimization/ visualizer. html
[4] http:/ / grafoanalizator. unick-soft. ru
[5] https:/ / gephi. org/
[6] http:/ / graphx. codeplex. com
7

,
.
(),
.
. G=(V,E),
V
, E VV.
, ,
().
,
, ..
, ,
, .. . ,
, , , ,
.

. 1736
,
.

. , ,
1981 : , .
, , -, .
/.

:
, , , .
( - ).
, () .
, .
. ,
( ), .
, (
), . ,
,
.
( ),
. ,
8
, . ,
( ,
). ,
, .

,
1736.
1852,
1976 ( 4- ()).
NP- .
NP- .
() .
.
(
,
).
, .

( , [1],
);
, .
.
.
(- )
. , .

(
)[2].

., . . .: , 1974. 368c. [3]
. ., . ., . . . .: . , 1976. .392.
. . .: , 1962. 320c. [4]
. ., . ., . ., . . . .: ,
1990. 384. (.2, . .: , 2009. 392 .)
. . [5]. .: , 2004. .664. ISBN
5-9502-0057-8(.: , 1987. 383c.)
. . . . . . .: , 1987.
. . Maple. .: , 2007. 168 c. http://vuz.exponenta.ru/PDF/book/GrMaple.
pdf http://eqworld.ipmnet.ru/ru/library/books/Kirsanov2007ru.pdf
. . . .: , 1978. 429c. [6]
9
. . . VI. // : =
Introduction to Algorithms. 2- . .: , 2006. .1296. ISBN 0-07-013151-1
. [7]. 2- . .: , 1980. .336.
. . . . [8]. .:
- , 1997. ISBN 5-02-015033-9
., . , . : , 1984. 455. [9]
. . . . .: , 1988. 424 . [10]
. . . .: , 1977. 208. [11]
. [12]. .: , 1973. (. 3, .: , 2006. 296 .)
., . [13]. , 1977.
Diestel R. Graph Theory, Electronic Edition [14]. NY: Springer-Verlag, 2005. .422.
[15] // . 1996. .3.
.144-145. , .

[1] .., .., .., (http:/ / thermotree. narod. ru/ contybg1983.
htm), : (. ), 1983.- 255 c.
[2] . ., . ., .. . .: , 1990.
216 .
[3] http:/ / eqworld. ipmnet. ru/ ru/ library/ books/ BasakerSaati1974ru. djvu
[4] http:/ / eqworld. ipmnet. ru/ ru/ library/ books/ Berzh1962ru. djvu
[5] http:/ / www. dleex. com/ read/ ?5561
[6] http:/ / eqworld. ipmnet. ru/ ru/ library/ books/ Kristofides1978ru. djvu
[7] http:/ / eqworld. ipmnet. ru/ ru/ library/ books/ Ore1965ru. djvu
[8] http:/ / www. krelib. com/ ?cat=106& file=3816
[9] http:/ / dlc. crimea. edu/ catalogue/ informatika/ ocr-030801052953. djvu
[10] http:/ / ru. dleex. com/ read/ 5623
[11] http:/ / eqworld. ipmnet. ru/ ru/ library/ books/ Uilson1977ru. djvu
[12] http:/ / eqworld. ipmnet. ru/ ru/ library/ books/ Harari1973ru. djvu
[13] http:/ / eqworld. ipmnet. ru/ ru/ library/ books/ HarariPalmer1977ru. djvu
[14] http:/ / diestel-graph-theory. com/ GrTh. html
[15] http:/ / www. iqfun. ru/ articles/ sim. shtml

(http://compscicenter.ru/program/lecture/6141)
WikiGrapp (http://pco.iis.nsk.su/WikiGrapp/)
C++ (http://e-maxx.ru/algo/)
, , , (http://rain.ifmo.ru/cat/view.php/
theory/list)
(http://www.xumuk.ru/encyklopedia/1148.html)
Intelligent Graph Visualizer ( , ,
.) (https://sourceforge.net/projects/igv-intelligent/)
Graph Theory Software (http://graphtheorysoftware.com/)
10

, :
(. , 1736.)
, .

,
. G
, ,
, .
(:
. . 2- [7]. .: , 1980. 336.
. [12]. .: , 1973.
. . . . [8]. .:
- , 1997. ISBN 5-02-015033-9
11

(.Matrix tree theorem),
.

.
.

G (3 )
G : .
, , M1, 2 ,

.
.
, 1:
.

. , : [1], 11: " ", 25.07.2006
[2]

[1] http:/ / www. intuit. ru/ studies/ courses/ 58/ 58/ lecture/ 891?page=4
[2] http:/ / rain. ifmo. ru/ cat/ view. php/ theory/ graph-general/ cayley-2008/
12

.
( ).

.
.

. .
- (v, k, ) v
k .

. .
, : , / / .
G V(G).
, . ,
, .
, (
).
, 1 ( ).
( , -) 0, .
.

, .
, .
, .
, ,
, .
,
. .
( n-
, ).
,
.
, ,
. .
13
. ,
( ).
g , g
g-1. , 0.

. ,
, A ,
B .
( , ) ,
V , E
( ). ,
. .
, .
, , .
, .
, .
.
, .
( ).
, M k ( ).
( , ). v1, v2, , vn
n-1.
.
, ,
, .

- .

, 0 ( ).
. , ,
. , , -
, (
).
,
.
,
,
, , , .
, : ,
, ,
. ( ) .
() .
14

.
, , ,
.
(.Clique number) (G) .
, .
.
( Wn) n (n 4),
(n-1)-.
.
,
,
.
,
, ,
.
.
; .
, ,
.
, .
.
3,
.
k- G, c(G)=k
k- , ,
, . ,
1-, 2-.

n G, , -, k G,
k , , 2k 3 , -, G 2n 3 .
. .
.
. , 2
.
15

- ,

. - ,
.
. ,
.
,
. , , .
,
.
,
( ) ( ).
1,
. 1,
, -1, ;
( ) 0.
,
. ,
( ).
, 2.
- ,

. - ,
.
( , )
( ) , ,
,
.
v , v.
,
, .
, ,
(), .

,
.
.
( )
G, , (
).
, ,
.
Q G, a(G) = max |S| ( S
Q) G, S*,
16
, .
.
- ( , ) 0, ,
.

.
( ) ,
, .
k k v;
, v k.
, .
, G = (V,E) , V (), E
( ). (v, w), v
, w . , v w v w,
w v.
() ()
, .
, .

.
, .
( ) ,
, .
(
).
, .
, () .
, , ,
, . ,
.
, ,
( ). .
,
. (. .)

, , ,
( ).
,
.
,

v , . .
v , .
.
17
, - , ,
- .
, .
, .
,
. ,
.

,
.
, .
, .
, [1]. ,
.
, .
, / .
( , -) 0, ,
.
( ) / ( ),
, () ().
() .
.
v1, v2, , vn, v1 v2, v2
v3, , vn-1 vn. , v1, v2, v3, ,
vn-1, vn.

; ,
, .

.
, .
, .
, S, f : A S
g : R S.
.
.
, .
, ,

.
( ).
(
), .
( ),
. () , .
. .
18
, .
. .
.
0 ( , , -) .

, .
. , () .
, .
, ,
, , .
, , , ,
.
, .
. ,
.
, .
, : ,
, ; , ,
. (. .)
, , .
, .
, ,
.
,
.
G, x. .
G . .
,
. ,
.
( ) ,
. (. .)
, ( ,
)

, .
, .
, .
, ;
.
, .
, .
19

, .
: ,
, . (. , .)
, , ,
, 1. .

(, ).

n- .
n- n-.

, ,
, , .
.

, :
, , .
, . ( )
, ().
. u v u v. , u
v . .
, , .
. .
( ) 1,
.
, .
, ,
. :
, , ,
.
20

, .
, .

,
.
( Gn) ,
.

, ,
( ).
( ) (), (
).

.
, , , , ,
. , ,
, ( ).
: (
, , u v) , u v.
( ),
u v.

[2]
[3]
[1] . ., - . . / . / .: , 1980344 ., . . 120122
[2] http:/ / pco. iis. nsk. su/ grapp/
[3] http:/ / vuz. exponenta. ru/ PDF/ teogr. html

. . .: , 2003. 300. ISBN 5-354-00301-6
Graphviz 21
Graphviz
Graphviz
[1]
AT&T
Linux, Mac OS X . UNIX-, Windows
[2]
2.34.0 (6 2013 )
Eclipse Public License
[3]
graphviz.org
Graphviz ( .Graph
Visualization Software)
,
DOT,
TUI GUI
, ,

.
Graphviz
AT&T
, GraphViz
EPL (Eclipse Public License)

, Linux, Mac OS, Unix-, Microsoft Windows.
Graphviz 22

Graphviz ,
DOT,
, :
dot
(PNG, PDF, PostScript, SVG ..).
neato (spring model, energy minimised)
.
twopi .
circo .
fdp fdp .
dotty GUI .
lefty GUI- ( EZ[4][5]).
DOT
dot, ,
DOT ,
, .
dot .
, :
digraph G{
->->->->;
->;
->;
}
dot ,
.
GraphViz Wiki
GraphViz ,
.

[1] Graphviz (http:/ / www. graphviz. org/ Credits. php)
[2] Graphviz (http:/ / www. graphviz. org/ pub/ graphviz/ stable/ SOURCES/ )
[3] http:/ / www. graphviz. org/
[4] EZ (http:/ / portal. acm. org/ citation. cfm?id=318642)
[5] The Lefty guide (Editing Pictures with lefty) (http:/ / graphviz. org/ pdf/ leftyguide. pdf) ( Lefty).
Graphviz 23

(http://www.graphviz.org/)
(http://lib.custis.ru/Graphviz)
MoWeS
MoWeS Portable PHP5 MySQL
MediaWiki 1.5.1 USB -,
.
MoWeS (http://www.mediawiki.org/wiki/Manual:Installing_on_MoWeS_Portable_(Windows))
MoWeS (http://www.chsoftware.net/en/useware/mowes/mowes.htm)
GraphViz (http://www.mediawiki.org/wiki/Extension:GraphViz/ru)
MSGGen (-) (http://www.mediawiki.org/wiki/Extension:MscGen)
GraphViz MSGGen (http://www.mediawiki.org/wiki/
Extension:GraphVizAndMSCGen)
Graphviz (http://www.wikischool.de/wiki/WikiSchool:Graphviz)
Haus vom Nikolaus

Das Haus vom Nikolaus (.The house of the St Nicholas) , ,
, ( ) 8 ,
. , .

. ,
19- .

: 1 Das 2 ist 3 das 4 Haus 5 vom 6 Ni- 7 ko- 8 laus
:

2 Das ist das Haus vom Ni-ko-laus und ne-ben-an vom

Weih-nachts-mann
: Das ist das Haus vom Ni-ko-laus mit
Ga-ra-ge und ei-nem Fh-ne-lein drauf
2 , : Das ist das Haus vom
Ni-ko-laus und ne-ben-an vom Weih-nachts-mann und ber der Stra, das vom Oster-has
Haus vom Nikolaus 24

, : ,
. , (1 2) .
, .
1, 44 .

1986 Reinhold Braun.
-.
Klaus Huneke, 1983 , .

Manfred Nitzsche: Graphen fr Einsteiger. Rund um das Haus vom Nikolaus. In: Studium. 3., berarbeitete und
erweiterte Auflage. Vieweg+Teubner, Wiesbaden 2009, ISBN 978-3-8348-0813-4.
Frank Schwellinger: Das neue Haus vom Nikolaus. 66 mathematische Weihnachtsrtseleien. rororo 62719,
Reinbek bei Hamburg 2010, ISBN 978-3-499-62719-4.
Volker Backert: Das Haus vom Nikolaus. [Roman]. Emons, Kln 2010, ISBN 978-3-8970-5740-1 (ein Krimi).

Counting Eulerian Circuits and Tours [1](.)
Ausfhrliche Erklrungen mit Entstehungshintergrund [2]
Algorithmische Umsetzung in C [3]
Interaktive Seite zum Ausprobieren verschiedener Lsungen [4]
Die Eulertour [5] Algorithmus der Woche im Informatikjahr 2006 (RWTH Aachen)

[1] http:/ / www. mathematik. uni-bielefeld. de/ ~sillke/ PUZZLES/ nikolaus
[2] http:/ / www. mathematische-basteleien. de/ nikolaushaus. htm
[3] http:/ / www. linux-related. de/ index. html?/ coding/ alg_nikohaus. htm
[4] http:/ / www. steyrerbrains. at/ material/ OneLineInteractive. html
[5] http:/ / www-i1. informatik. rwth-aachen. de/ ~algorithmus/ algo9. php
25

, .

.
.
,
.
,
. , ,
( ).

.
, , (
); .

,
. -
. ,
, .
. , ,
.
, , .
. ,
, .

, ,

p- .

.[1]
26

, .[2]
.

, :

, ,
.[3]
,
, .
,

.

,
. . ,
,
.[4][5]

[1] .. . 121
[2] . . 190
[3] . . 192
[4] . . 198201
[5] . . 317

, . .: , 2004. 520. ISBN 5-354-00957-X.
, . .: , 2008. 352 . ISBN 978-5-397-00044-4.
, . .: , 2003. 300 . ISBN 5-354-00301-6.
27

(.CuthillMcKee)
(.)
.
(RCM, reverse
CuthillMcKee)
.

.
,

.
, .
:
1. ( )
;
2. , , 3-5:
3. , - ,
, , : ;
4. ;
5. .
, ,
.
[1].
RCM ,
, , ,
.[2]

.
,
.
(.rooted level structure).
:

28
:[3]
1. ;
2. : ;
3. ;
4. : ;
5. , 3;
6. .

[1] , , 1984, pp. 65-66
[2] , , 1984, p. 68
[3] , , 1984, pp. 70-72

E. Cuthill and J. McKee. the bandwidth of sparse symmetric matrices (http://portal.acm.org/citation.
cfm?id=805928''Reducing) In Proc. 24th Nat. Conf. ACM, pages 157172, 1969.
., . = Computer Solution of
Large Sparse Positive Definite Systems. .: , 1984. 333.

- (http://www.boost.org/doc/libs/1_37_0/libs/graph/doc/
cuthill_mckee_ordering.html) Boost C++.
- (http://ciprian-zavoianu.blogspot.com/2009/01/
project-bandwidth-reduction.html).
- (.) (http://digital-space.ru/fizmat/
algoritm-katxilla-makki/).
- Python (http://digital-space.ru/programming/
algoritm-katxilla-makki-realizaciya-na-python/).
29

( . link analysis) ,
() (/).
: , , .. link
analysis ( : )
.
,
, .
,
.
Data Mining.
, .
, , ,
[!][1]: , , .

.
1975 Anacpapa Chart [2].
: ,
. ,
, , (Patterns of interest).
.

,
. ,
.

. , [3],
, .
.

, ,
. ,
, , ,
. ( ) .
( ),
, . [4]
:
1. ,
;
2. , ;
30
3. .
[5],
, , ,
, . :
1. ( );
2. , ;
3. ,
(, ).

- ,
.
,
, .
, ,
(, , , ).

.
, ,
. Data Mining
Text mining [6].

.
,
.

[7] ,
, ,
.
.

, ,
. 1 (2 )
(g-1), g .
31

(
) .
:
, L
.
:

, ,

.

[8]

, .
:

,
,

:
:

,
.
:

. ,
.
:
32
d(ni,nj) - ni nj.
(g-1)-1. ,

:

:

. , n2 n3 n2, n1, n4 n3, n1 n4
n2 n3.
:
gik(ni) - ,
ni.
(g-1)(g-2)/2,

:

:

. ,
, .
,
[9]

[1] Ahonen, H., Features of Knowledge Discovery Systems (http:/ / www. cs. helsinki.
fi/ u/ hahonen/ features. txt).
[2] Harper and Harris, The Analysis of Criminal Intelligence, Human Factors and
Ergonomics Society Annual Meeting Proceedings, 19(2), 1975, pp. 232-238.
[3] http:/ / www. centrifugesystems. com/

[4] Holland P. W., LeinhardtS. The structural implications of measurement error in sociometry // J. Match. Sociol, 1973. Vol. 3. P. 85-111.
[5] Burt R. S. Models of network structure//Annu. Rev. Sociol, 1980. Vol. 6. P. 79-141.
[6] http:/ / en. wikipedia. org/ wiki/ Text_mining
[7] McGrath, C., Blythe, J., Krackhardt, D., Seeing Groups in Graph Layouts (http:/ / www. andrew. cmu. edu/ user/ cm3t/ groups. html)
[8] Freeman L. Centrality in social networks, conceptual clarifications / / Soc. Networks, 1979. Vol. 1. P. 215-236.
[9] Burt R. S. Social contagion and innovation: cohesion versus structural equivalence.//American Journal of Sociology, 1987.92: 1287-1335.
33

. . : / . . . . .:
, 2004.
.. Data Mining. .: , 2008
Thelwall M. Link Analysis: An Information Science Approach. New York: Academic Press, 2004.

()
,
.

A(G) G
,
G.

,
, .

A(G) 2 , G
.
A(G)
(G) G
: 3.
A(G) 4 (G) = 3. (Grnbaum

1973)
A(G) 5 (G) = 4. (Burstein 1979)
A(G) 8 (G) = 5.(Yadav, Satish 2008)
A(G) 12 (G) = 6.(Yadav, Satish 2009)
:
. (Borodin 1979)
A(G) 5 G .
(1973) ,
.
450 . ,
. (Stein 1970, 1971)
34

, A(G) 3 NP- (Kostochka 1978).
(Coleman, Cai 1986) , NP- .
. (Gebremedhin, Tarafdar, Pothen, Walther 2008) ,
.
O(n+m),
.
3 4
(Skulrattanakulchai 2004). (Yadav, Satish 2008)
5
8 , 6
12 .

en:Star coloring

O. V. BorodinOn acyclic colorings of planar graphs // Discrete Mathematics. 1979. .25.
.211236. DOI: 10.1016/0012-365X(79)90077-3 (http://dx.doi.org/10.1016/0012-365X(79)90077-3).
M. I. BursteinEvery 4-valent graph has an acyclic 5-coloring (in Russian) // Soob. Akad. Nauk Gruzin. SSR.
1979. .93. .2124.
B. GrnbaumAcyclic colorings of planar graphs // Israel J. Math.. 1973. .14. .390408. DOI:
10.1007/BF02764716 (http://dx.doi.org/10.1007/BF02764716)
Thomas F. Coleman, Jin-Yi CaiThe Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices //
SIAM. J. on Algebraic and Discrete Methods. 1986. .7. .221235. DOI: 10.1137/0607026 (http:/
/dx.doi.org/10.1137/0607026).
Guillaume Fertin, Andr RaspaudAcyclic coloring of graphs of maximum degree five: Nine colors are enough //
Information Processing Letters. 2008. .105. .6572. DOI: 10.1016/j.ipl.2007.08.022 (http://dx.
doi.org/10.1016/j.ipl.2007.08.022).
Kishore Yadav, Venkaiah SatishAcyclic coloring of graphs of maximum degree five: Eight colors are enough //
ICGTA. 2008. .nil. .nil..
Kishore Yadav, Venkaiah Satish, Kishore Yadav, Kishore KothapalliAcyclic coloring of graphs of maximum
degree six: Twelve colors are enough // Electronic Notes in Discrete Mathematics. 2009. .35.
.177182. DOI: 10.1016/j.endm.2009.11.030 (http://dx.doi.org/10.1016/j.endm.2009.11.030).
Assefaw H. Gebremedhin, Arijit Tarafdar, Alex Pothen, Andrea WaltherEfficient Computation of Sparse
Hessians Using Coloring and Automatic Differentiation // Informs Journal on Computing. 2008. .21.
.209. DOI: 10.1287/ijoc.1080.0286 (http://dx.doi.org/10.1287/ijoc.1080.0286).
Jensen, Tommy R.; Toft, Bjarne (1995). Graph coloring problems. New York: Wiley-Interscience. ISBN
0-471-02865-7.
Kostochka, A. V. (1978). Upper bounds of chromatic functions of graphs (in Russian). Doctoral thesis,
Novosibirsk.
35
San SkulrattanakulchaiAcyclic colorings of subcubic graphs // Information Processing Letters. 2004.

.92. .161167. DOI: 10.1016/j.ipl.2004.08.002 (http://dx.doi.org/10.1016/j.ipl.2004.08.002).
S. K. SteinB-sets and coloring problems // Bull. Amer. Math. Soc.. 1970. .76. .805806. DOI:
10.1090/S0002-9904-1970-12559-9 (http://dx.doi.org/10.1090/S0002-9904-1970-12559-9)
S. K. SteinB-sets and planar maps // Pacific J. Math.. 1971. .37. .217224.

Star colorings and acyclic colorings (1973) (http://www.math.uiuc.edu/~west/regs/starcol.html), present at
the Research Experiences for Graduate Students (REGS) (http://www.math.uiuc.edu/~west/regs/) at the
University of Illinois, 2008.
Acyclic Coloring of Graphs of Maximum Degree (http://www.math.tu-berlin.de/EuroComb05/Talks/
Contributed/15-Fertin.pdf), talk slides presented by G. Fertin and A. Raspaud at EUROCOMB 05, Berlin, 2005.

- (.scale-free network) ,
,
.
, ,
, , , WWW,
.

Scale-free network [1] Scholarpedia.

[1] http:/ / www. scholarpedia. org/ article/ Scale-free_networks
36
11
( )
, en:Leo Moser ,,
. ,
, ,
, , .
,
en:Hajs construction.
, , .
37

,
60 120 ,

.
,
,
.
,
,
.
,
, .

, ,
en:Hajs construction,
.
,
, ,
.
en:Hajs construction

, K3,3
.

,
, , ,
. , ,
, .

, ,
. ,
.
, , , en:degeneracy (graph theory) .
, ,
. , , ,
. ,
,
.
,
. en:De BruijnErds
38
theorem (graph theory) ( , )

.
, ,
. ,
, .

, , .
,
. , .
, , en:rigid system
. ,
, , ,

en:pseudotriangle .
. ,

, ,
.
,
, en:graph homomorphism
. ,
(Horvat, Kratochvl, Pisanski 2011), ,
NP- .
3SAT,
en:Gadget (computer science), .

T
( ), , T ,
, .
M , . M+T
M T. M+T ,
, M+T
, ,
. ,
M+T,
. , T .[]

Weisstein, Eric W. Moser Spindle (http://mathworld.wolfram.com/MoserSpindle.html)(.)
Wolfram MathWorld.
( ) 39
( )
,

(
),
( ).
, ,
,
( ), .
6 7 ,
, 6
, ,
, ,
. , ,
.
, , ,
. , w v, (v,w).
v , , v.

, . ,
. , , .
( ), .
( ) ( ).
, .
, .
,
. k- , k
. ,
, ,
. en:vertex space
, , ( {0,
1}).[1]
-, ,
. en:graph enumeration
.
, .
vb ,
. ,
.
en:vertex (geometry),
en:skeleton (topology) ,
, (
), . en:vertex figure
.
( ) 40

()

[1] 4

Giorgio Gallo, Stefano PallotinoShortest path algorithms // Annals of Operations Research. 1988. .1.
.13. .179. DOI: 10.1007/BF02288320 (http://dx.doi.org/10.1007/BF02288320)
. en:Claude Berge . :
, 1962.
Gary Chartrand Introductory graph theory. New York: Dover, 1985. ISBN 0-486-24775-9
Norman Biggs, E. H. Lloyd, Robin J. Wilson Graph theory, 1736-1936. Oxford [Oxfordshire]: Clarendon
Press, 1986. ISBN 0-19-853916-9
Frank Harary Graph theory. Reading, Mass.: Addison-Wesley Publishing, 1969. ISBN 0-201-41033-8
Frank Harary, Edgar M. Palmer, Graphical enumeration. New York: Academic Press, 1973. ISBN
0-12-324245-2
s
Weisstein, Eric W. Graph Vertex (http://mathworld.wolfram.com/GraphVertex.html)(.) Wolfram
MathWorld.
k- 41
k-
, G k-- ( k-), k
(, ) k .
, , k,
k--.
, , , k, k
, .
, . n
n1, .
k ,
. (Diestel 2005, . 55).
, n1 Kn.
1- , 2- . 3-
.
1-en:Skeleton (topology) k- k--
( en:Balinski's theorem, Balinski 1961). en:Steinitz's
theorem , 3--
.

k-

en:Structural ccohesion
en:Tutte embedding

M. L. BalinskiOn the graph structure of convex polyhedra in n-space // Pacific Journal of Mathematics.
.2. .11. .431434..
Reinhard Diestel Graph Theory. 3rd. Berlin, New York: Springer-Verlag, 2005. ISBN
978-3-540-26183-4.
- 42
-
- G, , v1
v2 G
, -,
. - ,
.
-,
- . -
(, ), -
(, en:Tietze's graph).

-
( ,

). (
)
-,
( ).
, (Potonik, Spiga, Verret)
(
3) -
, 1280.

- (
), .

- d,
2(d+1)/3. 4 , ,
, d.

- :
( )
,
en:uniform tessellation (. en:List of uniform planar tilings
), .
.
.
- en:Glossary of Riemannian and
metric geometry#Q, .
- 43
, - .
(Reinhard Diestel) (Imre Leader)
2001-. 2005- , (Eskin, Fisher, Whyte) .

A census of small connected cubic vertex-transitive graphs (http://www.matapp.unimib.it/~spiga/index.
html). Primo Potonik, Pablo Spiga, Gabriel Verret, 2012.
( )

, .

, r c
, n r*c.
, , r=5, c=8 n=40. r
, ,
,
. , c ,
,
,
. S
, S ,
A B,
.
n/2 .
rc ( ),
S rn , , , cr,
n . , -
S , n, ,
, n/2.[1]

T, S, ,
T ( )
, ,
n/2. , ,
,
.
en:centered tree en:centered
.
tree. , ,

,
.
( ) 44

S (a,b)-, , a b. S
(a,b)-, S a b. S
, -
(a,b) . ,
:
. S G , ,
S G, , S
.
: a b
G (a,b)- S (a,b)- T,
a b S T. ,
: S T (a,b)- 'G'. S
T, , ,
x b T. ,
(a,b)-. , (Escalante 1972) ,
,
(a,b)- G.

, .

[1] . ,
.
References
F. Escalante Abhandlungen aus dem Mathematischen Seminar der Universitt Hamburg. 1972. .38.
.199220. DOI: 10.1007/BF02996932 (http://dx.doi.org/10.1007/BF02996932)
J. Alan George,Nested dissection of a regular finite element mesh // SIAM Journal on Numerical Analysis.
1973. .2. .10. .345363. DOI: 10.1137/0710032 (http://dx.doi.org/10.1137/0710032).
Martin Charles Golumbic Algorithmic Graph Theory and Perfect Graphs. Academic Press, 1980. ISBN
0-12-289260-7.
Camille JordanSur les assemblages de lignes (French) // Journal fr die reine und angewandte Mathematik.
1869. .2. .70. .185190.
Arnold Rosenberg, Lenwood HeathGraph Separators, with Applications. Springer.. 2002. DOI:
10.1007/b115747 (http://dx.doi.org/10.1007/b115747)
45

1. #

, ,
. ,
( , ), , ,
, .
, , ,
, .

, , ,
, . ( )
. (,
). .
, . ,
, , , .

,
.
,
,
.
.
, -
, .
[1]:
;
;
;

;
,

[2];
( ).
46

.
:
:
. , ,
.
: .
:
.
.
:
.

: .
.
.
.
.

[1] Di Battista, Giuseppe; Eades, Peter; Tamassia, Roberto; Tollis, Ioannis G. Graph Drawing: Algorithms for the Visualization of Graphs.
Prentice-Hall, 1999. 397 p. ISBN 0-13-301615-3.
[2] . , ,
, 4 , .

graphdrawing.org (http://graphdrawing.org/): Graph Drawing Steering
Committee, .
, .) (https://sourceforge.net/projects/igv-intelligent/)
Visual Graph Editor 2 (
JavaScript- .) (http://code.google.com/p/vge2/)
Visual Graph (http://code.google.com/p/visualgraph/): ,
.
, () 47
, ()
en:mathematical puzzle, ,
() , ,
:
( ) ,
. ,
.
?
.

en:Henry Dudeney ,
en:electric lighting, . (Kullman)
, .

.

. .[1]

en:topological graph theory,
.
, ,
K3,3 .
.[2]. .
Ci6(1,3).
, K3,3
1930 , K3,3 ,
. , , :
, K3,3.
K3,3 ,
.
4 , .
, n m
( f
) , (
). , m=9 2n4=8,
,
, en:Kuratowski's theorem,
, K3,3, K5,
en:Wagner's theorem, , K3,3,
K5 en:minor (graph theory), .
, () 48

K3,3 en:toroidal graph, ,
. ,
, ( ) .

.
en:graph genus ,
,
. .
en:Pl Turn
en:crossing number
K3,3
(graph theory) Ka,b .
a b . K3,3
, , .
K3,3 , a .

K3,3 , , en:well-covered
graph, , .
, ,
. K3,3 3- 3- .
, ,
en:structural rigidity ( ).
, , K5,
.

[1] Gas Water Electric Puzzle (http:/ / puzzles. nigelcoldwell. co. uk/ twentysix. htm)
[2] Utility Graph (http:/ / mathworld. wolfram. com/ UtilityGraph. html)

Weisstein, Eric W. Utility graph (http://mathworld.wolfram.com/{{{urlname}}}.html)(.)
Wolfram MathWorld.
The Utilities Puzzle (http://www.archimedes-lab.org/How_to_Solve/Water_gas.html) explained and 'solved'
at Archimedes-lab.org
3 Utilities Puzzle (http://www.cut-the-knot.org/do_you_know/3Utilities.shtml) at cut-the-knot
Jim LoyProof That the Impossible Puzzle is Impossible.
49

G ,
G
. ,

, .

en:partial cube . , 1-2-5 ,
, en:Helly 2-3-4 ,
property
2 4.
, .

H.-J. Bandelt, V. ChepoiSurveys on Discrete and Computational Geometry: Twenty Years Later / Jacob E.
Goodman, Jnos Pach, R. Pollack. Providence, RI: AMS, 2008. .453. .4986..
Wilfried Imrich, Sandi KlavarA convexity lemma and expansion procedures for bipartite graphs // European
Journal of Combinatorics. .6. .19. P.677686. DOI:10.1006/eujc.1998.0229 [1].
[1] http:/ / dx. doi. org/ 10. 1006%2Feujc. 1998. 0229

,
. , (
) .
n N :
. ,
( ),
.
,
, , , (1)
.
, , ,
, ,
, , , , .
50

,
,
.
,
,
, ,
( ) ,
.
:
, ,
,
.
,
. .
,
.

. . , . . , . . , . . XI: //
. .: , 1990. .298315. 384. ISBN 5-02-013992-0
. . //
. 2005. 3. .1018.
. . , . . [1]. : , 1999.
. . // . 1974. 6 (180).
.., .., .. .
.: , 1990. 216 .

[1] http:/ / pco. iis. nsk. su/ grapp2/ html/ ReqtypetNamegipergraf. htm
51

en:domination number
. . ,
(G) G,
(G H) (G)(H).
(Gravier, Khelladi 1995)
en:tensor product of graphs.
(Klavar & Zmazek 1996) . , ,
, , .
(Imrich, Klavar 2000).

4 C4

,
. C4 C4
. 16
,
,
15 16 .
,

, ,
.

,
. , K1,n

(K1,n) K1,4K1,4, . ,
. , ,
G=K1,nK1,n,
.
, ,
11=1. ,
, . n2+2n+1 n2
, 2n ,
. n -
, n - -
. , - ,
n - , n -
, - . ,
(K1,nK1,n)=n+1, , .
,
.[1] , G H
, (GH)=(G)(H). G
52
H C4 en:rooted
product of graphs .

, , G, H 1
, (G)(H)
.
, [2] .
(Clark, Suen 2000) ,
, , G H.

1968 ,
(G H) min{(G)|V(H)|, (H)|V(G)|}.
, ,
G H .

[1] ; ; ; .
[2] ; .

A. M. , .. //
. 1979. .1. .58..
W. Edwin Clark, Stephen SuenInequality related to Vizing's conjecture // Electronic Journal of
Combinatorics. 2000. .1. .7. .N4..
M. El-Zahar, C. M. PareekDomination number of products of graphs // Ars Combin.. 1991. .31.
.223227..
J. F. Fink, M. S. Jacobson, L. F. Kinch, J. RobertsOn graphs having domination number half their order //
Period. Math. Hungar.. 1985. .4. .16. .287293. DOI: 10.1007/BF01848079 (http://dx.
doi.org/10.1007/BF01848079).
S. Gravier, A. KhelladiOn the domination number of cross products of graphs // Discrete Mathematics.
1995. .145. .273277. DOI: 10.1016/0012-365X(95)00091-A (http://dx.doi.org/10.1016/
0012-365X(95)00091-A).
B. L. Hartnell, D. F. RallOn Vizing's conjecture // Congr. Numer.. 1991. .82. .8796..
Wilfried Imrich, Sandi Klavar Product Graphs: Structure and Recognition. Wiley, 2000. ISBN
0-471-37039-8.
M. S. Jacobson, L. F. KinchOn the domination of the products of graphs II: trees // J. Graph Theory. 1986.
.10. .97106. DOI: 10.1002/jgt.3190100112 (http://dx.doi.org/10.1002/jgt.3190100112).
Sandi Klavar, B. ZmazekOn a Vizing-like conjecture for direct product graphs // Discrete Mathematics.
1996. .156. .243246. DOI: 10.1016/0012-365X(96)00032-5 (http://dx.doi.org/10.1016/
0012-365X(96)00032-5).
C. Payan, N. H. XuongDomination-balanced graphs // J. Graph Theory. 1982. .6. .2332. DOI:
10.1002/jgt.3190060104 (http://dx.doi.org/10.1002/jgt.3190060104).
53
.. // . 1968.
.6. .23. .117134..

Weisstein, Eric W. Vizing Conjecture (http://mathworld.wolfram.com/VizingConjecture.html)(.)
Wolfram MathWorld.

.
: k- .

:
-

,
.

,

,
,
.

:

,
, , 4 , 4 ,
,
.
,
. K
- .
. , ,
, .
,
.
( ):
, , 5- ,
, .
54
1937 ,
, .
1993 . , . . ,
[1]
. 1994 .
, , ,
4 4 3 5 .

, ,
. NP- .
, .[2]
, , .

[1] Robertson, Neil; Seymour, Paul; Thomas, Robin (1993), Hadwigers conjecture for K6-free graphs (http:/ / www. math. gatech. edu/
~thomas/ PAP/ hadwiger. pdf)
[2] Kostochka, A. V. (1984), "Lower bound of the Hadwiger number of graphs by their average degree"

-
. . ,
.

G , G p, ,
G p . A c p p-.
p-
p .
, G ,
G, ,
G. ,
6. ,
, .
55

1973- :
p cp, , p- G n
cp n.
, G n p-, G
cp n .

, , ,
, ,
cp.
(Nancy Eaton) .
, p- ,
, , Kp (
, ,
). .
, , ,
.
, ,
. , , cp, ,
p- G n ,

(Stefan Burr), . = Infinite and finite sets (Colloq.,
Keszthely, 1973; dedicated to P. Erds on his 60th birthday), Vol. 1. Amsterdam: North-Holland, 1975.
.10. .214240. (Colloq. Math. Soc. Jnos Bolyai)..
(Guantao Chen), (Richard H. Schelp).
= Graphs with linearly bounded Ramsey numbers // Journal of Combinatorial Theory, Series
B. 1993. .1. .57. .138149. DOI: 10.1006/jctb.1993.1012 (http://dx.doi.org/10.1006/
jctb.1993.1012).
(Ronald Graham), (Vojtch Rdl), (Andrzej Rucnski).
(, 1999) = Paul Erds and his mathematics (Budapest, 1999) //
Combinatorica. 2001. .2. .21. .199209. DOI: 10.1007/s004930100018 (http://dx.doi.
org/10.1007/s004930100018)
56
: , ?

, ,
3 ,
.
1995
en:Andrs Gyrfs.
, (Gordon
Royle) (Klas Markstrm), ,
17 ,
30 .
24 ,
16 , 24 ,

.
4 8,
,
. , ,
:
16.
, , ,

[1]
). , [2] ,
[3].

[1] , 2005
[2] , , 2001
[3] , 1998

Daniel, Dale & Shauger, Stephen E. (2001), "A result on the ErdsGyrfs conjecture in planar graphs", Proc.
32nd Southeastern Int. Conf. Combinatorics, Graph Theory, and Computing, . 129139.
Markstrm, Klas (2004), " Extremal graphs for some problems on cycles in graphs (http://abel.math.umu.se/
~klasm/Uppsatser/cycex.pdf)", Congr. Numerantium .171: 179192.
Shauger, Stephen E. (1998), "Results on the ErdsGyrfs conjecture in K1,m-free graphs", Proc. 29th
Southeastern Int. Conf. Combinatorics, Graph Theory, and Computing, . 6165
Sudakov, Benny & Verstrate, Jacques (2008), " Cycle lengths in sparse graphs (http://dx.doi.org/10.1007/
s00493-008-2300-6)", Combinatorica .28(3): 357372, DOI 10.1007/s00493-008-2300-6.
Verstrate, Jacques (2005), " Unavoidable cycle lengths in graphs (http://dx.doi.org/10.1002/jgt.20072)",
Journal of Graph Theory .49(2): 151167, DOI 10.1002/jgt.20072.
57

Exoo, Geoffrey. Graphs Without Cycles of Specified Lengths (http://ginger.indstate.edu/ge/Graphs/CYCLES/
index.html). 17 2013 (http://www.webcitation.org/6FC6p5Z1E).
West, Douglas B. Erds Gyrfs Conjecture on 2-power Cycle Lengths (http://www.math.uiuc.edu/~west/
openp/2powcyc.html). Open Problems - Graph Theory and Combinatorics (http://www.math.uiuc.edu/
~west/openp/index.html). 17 2013 (http://www.webcitation.org/
6FC6pXgku).

, ,
K1,3 ().
K1,3 ( , , ,
). ,
, ,
. ,
en:neighborhood (graph theory) .

,
: ,
en:perfect matching,

en:Maximum independent set ,
[1]
[2].

L(G) G . L(G)
G L(G)
G.
L(G) , e1,
e2, e3 G e4,
e1, e2, e3
.

. [1].
en:de Bruijn graph (, , ,
n- n,
.
(n 1)- ) .

n- (n 1)- .
[3].
.
58
,
, ,
, [3].
,
, .
.
( ), , , -en:cross polytop
( en:Turn graph,
), , en:16-cell.
, 27 , .

, n m O(n4)
.[4] ,
, , ,
.
, ,
, n n.
, -, ,
, O(n3.376).
, (Kloks,Kratsch,Mller) ,
,
, .
c
. , (m)
(m) , ,
(m3.376/2) = O(m1.688).

,
n , ,
, n. n , n = 1, 2,
1, 1, 2, 5, 14, 50, 191, 881, 4494, 26389, 184749, A022562 OEIS.
, :
1, 2, 4, 10, 26, 85, 302, 1285, 6170, A086991 OEIS.
, (Palmer,Read,Robinson,2002)
, en:graph enumeration.
59

(Sumner,1974) , , (Las
Vergnas,1975) ,

en:perfect matching.[5]
, ,

.
, ,
,
.
,

:
, v w, u,
,
. [5] .
, ,
, . ,
u v, , w
v, u . , v, w
u, v w .
.
, u , v
, u, w v, u.
v w u. ,
vw, u,
, u. , (Chrobak, Naor,
Novick, 1989) , ,
.
[2]
, (Faudree, Flandrin, Ryjek) ,
:
1. (r 1)- , K1,r
r 2.
2.
.
3. k, , k,
, k-
4. (2k + 1)-, k-
.
60

, ,
.
(Edmonds, 1965),

; (Sbihi, 1980)
,
en:Maximum independent set
.[6] (Minty, 1980)
( (Nakamura, Tamura,
2001) ) (
, )

, .

. [6].
(Sbihi), ,
.
, ,
. ,
, , , . ,
. , ,
,
, , .

( H G, V
V, G H, , G,
H).
.
,
, . ,
:
, . .
, v
, v. v .
-en:Skew-symmetric
graph, . - ,
, ,
. -
, ,
, 2 , I.
I, 2 .
-
. -
, O(n) .
61
, O(n3) .
,
, en:maximum
clique , . (
en:Strong perfect graph theorem),
,
( ).
, .
,
.
. .

[7].
, NP-[4].
NP-, ( )
NP- [4]. NP-
, 4/3.
, ,
en:greedy coloring,
.
, ,
. en:domination perfect graph,
en:dominating set,
, .
. , , D
v w D. , v, w,
( v ).
D, v
. v
, .
, D, ,
D ,
[8].
,
NP- [4]. ,
,
en:parameterized complexity
,
.
62

,
en:graph structure theorem - ,
(Robertson) (Seymour), ,
(Chudnovsky), (Seymour)
. , ,
, . -, ,
( ) ,
:
1. ,
.
2. ,
. ,
.
, , .
(Chudnovsky) (Seymour)
:
1. . ,
, . .
2. , .
3. , ,
.
. ,
srg(27,16,10,8), .
en:polyhedral
combinatorics ,

.

[1] Faudree, Flandrin, Ryjek, 1997, . 88
[2] Faudree, Flandrin, Ryjek, 1997
[3] Faudree, Flandrin, Ryjek, 1997, . 89.
63

Ralph Faudree, Evelyne Flandrin, Zdenk RyjekClaw-free graphs A survey // Discrete Mathematics.
1997. .13. .164. .87147. DOI: 10.1016/S0012-365X(96)00045-3 (http://dx.doi.org/10.
1016/S0012-365X(96)00045-3)

Claw-free graphs (http://wwwteo.informatik.uni-rostock.de/isgci/classes/gc_62.html),
on Graph Class Inclusions
Mugan, Jonathan William; Weisstein, Eric W. Claw-Free Graph (http://mathworld.wolfram.com/
Claw-FreeGraph.html)(.) Wolfram MathWorld.

,
.
2, 4, 3-,
.
n , ,
, ,
.

, .
, , .
, m O(m1.41).[1]
A3, A . , ,
. ,
, O(n2.373), n .
, (Imrich, Klavar, Mulder 1999),
.
,
.
en:decision tree complexity en:decision tree complexity ,
, , (n2).
(n), O(n1.29) (Belovs
2011).

n , ,
(
), (
).[2]
,
64
.[3]
, triangle-free process (
) ,
, .
.
.[4]
R(3,t)
,
, ,
t, .

.
( , ) , ,
.[5]
.
(Mycielski 1955) , ,
. k,
k+1, ,
,
. , , 11 ,
, , ,
.[6] (Gimbel, Thomassen & 2000)
(Nilli 2000) , , m-

, , .

. (Andrsfai, Erds, Ss 1974) , n
, , .
, 5- ,
. , (Erds, Simonovits 1973)
, n ,
, . (Hggkvist 1981)
, ,
. (Jin 1995) ,
n , 3
. ,
. , (Brandt, Thomass 2006)
, n ,
, 4 . ,
(Hajnal)[7]
.
65

[1] Alon, Yuster, Zwick, 1994
[2] p. 184, .
[3] Kim, 1995
[4] Alon, Ben-Shimon, Krivelevich, 2008
[5] ; ).
[6] Chvtal, 1974
[7] . .
Sources
N. Alon, S. Ben-Shimon, M. KrivelevichA note on regular Ramsey graphs. 2008..
N. Alon, R. Yuster, U. ZwickProceedings of the 2nd European Symposium on Algorithms, Utrecht, The
Netherlands. 1994. .354364..
B. Andrsfai, P. Erds, V. T. SsOn the connection between chromatic number, maximal clique and minimal
degree of a graph // Discrete Mathematics. 1974. .3. .8. .205218. DOI:
10.1016/0012-365X(74)90133-2 (http://dx.doi.org/10.1016/0012-365X(74)90133-2).
T. BohmanThe triangle-free process. 2008..
Ravi Boppana, Magns M. HalldrssonApproximating maximum independent sets by excluding subgraphs //
BIT. 1992. .2. .32. .180196. DOI: 10.1007/BF01994876 (http://dx.doi.org/10.1007/
BF01994876).
S. Brandt, S. ThomassDense triangle-free graphs are four-colorable: a solution to the Erds-Simonovits
problem. 2006..
N. Chiba, T. NishizekiArboricity and subgraph listing algorithms // SIAM Journal on Computing. 1985.
.1. .14. .210223. DOI: 10.1137/0214017 (http://dx.doi.org/10.1137/0214017).
Vaek Chvtal Graphs and combinatorics (Proc. Capital Conf., George Washington Univ., Washington, D.C.,
1973). Springer-Verlag, 1974. .406. .243246. (Lecture Notes in Mathematics)..
P. Erds, M. SimonovitsOn a valence problem in extremal graph theory // Discrete Mathematics. 1973.
.4. .5. .323334. DOI: 10.1016/0012-365X(73)90126-X (http://dx.doi.org/10.1016/
0012-365X(73)90126-X).
P. Erds, S. Suen, P. WinklerOn the size of a random maximal graph // Random Structures and Algorithms.
1995. .23. .6. .309318. DOI: 10.1002/rsa.3240060217 (http://dx.doi.org/10.1002/rsa.
3240060217).
John Gimbel, Carsten ThomassenColoring triangle-free graphs with fixed size // Discrete Mathematics.
2000. .1-3. .219. .275277. DOI: 10.1016/S0012-365X(00)00087-X (http://dx.doi.org/10.
1016/S0012-365X(00)00087-X).
H. GrtzschZur Theorie der diskreten Gebilde, VII: Ein Dreifarbensatz fr dreikreisfreie Netze auf der Kugel //
Wiss. Z. Martin-Luther-U., Halle-Wittenberg, Math.-Nat. Reihe. 1959. .8. .109120..
R. HggkvistGraph Theory (Cambridge, 1981). 1981. .8999..
Wilfried Imrich, Sandi Klavar, Henry MartynMedian graphs and triangle-free graphs // SIAM Journal on
Discrete Mathematics. 1999. .1. .12. .111118. DOI: 10.1137/S0895480197323494 (http://
dx.doi.org/10.1137/S0895480197323494).
A. Itai, M. RodehFinding a minimum circuit in a graph // SIAM Journal on Computing. 1978. .4.
.7. .413423. DOI: 10.1137/0207033 (http://dx.doi.org/10.1137/0207033).
G. JinTriangle-free four-chromatic graphs // Discrete Mathematics. 1995. .1-3. .145.
.151170. DOI: 10.1016/0012-365X(94)00063-O (http://dx.doi.org/10.1016/0012-365X(94)00063-O).
J. H. KimThe Ramsey number has order of magnitude // Random Structures and Algorithms.
1995. .3. .7. .173207..
Frederic Magniez, Miklos Santha, Mario SzegedyQuantum Algorithms for the Triangle Problem. 2003..
J. MycielskiSur le coloriage des graphes // Colloq. Math.. 1955. .3. .161162..
66
A. NilliTriangle-free graphs with large chromatic numbers // Discrete Mathematics. 2000. .13.
.211. .261262. DOI: 10.1016/S0012-365X(99)00109-0 (http://dx.doi.org/10.1016/
S0012-365X(99)00109-0).
J. B. ShearerNote on the independence number of triangle-free graphs // Discrete Mathematics. 1983.
.1. .46. .8387. DOI: 10.1016/0012-365X(83)90273-X (http://dx.doi.org/10.1016/
0012-365X(83)90273-X).
C. ThomassenGrtzsch's 3-color theorem // Journal of Combinatorial Theory, B. 1994. .2.
.62. .268279. DOI: 10.1006/jctb.1994.1069 (http://dx.doi.org/10.1006/jctb.1994.1069).
Aleksandrs BelovsSpan Programs for Functions with Constant-Sized 1-certificates. 2011..

(.Call graph) ,
. ,
, (f, g) , f g.
,
, .
, .
.
.
.

, , [1]
1. ,
2. , , ,
,
3. , .
, , ,
, .
.
- .

, pf ,
. fun1
fun2 main, pf. c1, 2
[2].
int (*pf)(int);
int fun1(int x) {
if (x < 10)
c1: return (*pf)(x+l);
else
67
return x;
}
int fun2(int y) {
pf = &fun1;
c2: return (*pf)(y);
}
void main() {
pf = &fun2;
c3: (*pf)(5);
}
, pf, . fun1
fun2 , pf, main .
, pf main fun2,
fun2 fun1. pf
, , , pf main[2].

[1] : , , 2008, . 1062
[2] : , , 2008, . 1063

. , . , , . : ,
= Compilers: Principles, Techniques, and Tools. "", 2008. ISBN
0-321-48681-1

Ryder, B.G., Constructing the Call Graph of a Program, Software Engineering, IEEE Transactions on, vol.
SE-5, no.3pp. 216226, May 1979 (http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=35910&
arnumber=1702621&count=17&index=5)
Grove, D., DeFouw, G., Dean, J., and Chambers, C. 1997. Call graph construction in object-oriented languages,
SIGPLAN Not. 32, 10 (Oct. 1997), 108124. (http://doi.acm.org/10.1145/263700.264352)
Callahan, D.; Carle, A.; Hall, M.W.; Kennedy, K., Constructing the procedure call multigraph, Software
Engineering, IEEE Transactions on, vol.16, no.4pp.483-487, Apr 1990 (http://ieeexplore.ieee.org/xpls/abs_all.
jsp?isnumber=1950&arnumber=54302&count=13&index=12)
68
2
n
2
n1
n
4 if n2
n! 2
n

en:Moore graph
-
-

Qn
Qn 2n , 2n1n n
, . en:Skeleton (topology)
. , Q3 , 8 12
. , n
,
.
],
. , Q3.
69

Qn
n

,

. ,
2n , n-
,

1.

Q3 ( , ),
Q2 ,

1.
Qn+1 Qn
Qn , .
.
Qn n K2, .

Q0 , Q1 , Q2
4.
Q3 1-en:n-skeleton , .
Q4 .

.

, ,
.
70

Qn n>1 , .
, u,v , u v
.
.
. ,
n-
Qn. n-
.
,
. ,
.[1]

Qn (n > 1) :
.
.
en:partial cube .
22n-2 . ( ,
.)
.
en:Wreath product.
4,6,...,2n .

, S
S.
n- en:Balinski's theorem
( ) , n 3.
n .
Qn (n > 1) en:Lvy family of graphs

, en:Complete coloring Qn ,
.
en:graph bandwidth Qn .[2]
(-n,-n+2,-n+4,...,n-4,n-2,n),
(0,2,...,2n).
h(G)=1
71

en:longest path ,
en:snake-in-the-box.
en:Szymanski's conjecture
. , ,
() , , ,
, .

en:Cube-connected cycles
en:Fibonacci cube
en:Folded cube graph
en:Halved cube graph

[1] Ruskey, F. and Savage, C. Matchings extend to Hamiltonian cycles in hypercubes (http:/ / garden. irmacs. sfu. ca/ ?q=op/
matchings_extends_to_hamilton_cycles_in_hypercubes) on Open Problem Garden. 2007.
[2] Optimal Numberings and Isoperimetric Problems on Graphs, L.H. Harper, Journal of Combinatorial Theory, 1, 385393,

F. Harary, J. P. Hayes, H.-J. WuA survey of the theory of hypercube graphs // Computers & Mathematics with
Applications. 1988. .4. .15. .277289. DOI: 10.1016/0898-1221(88)90213-1 (http://dx.
doi.org/10.1016/0898-1221(88)90213-1).
72
11
20
10 (D5)
11 , 20 ,
4 en:Crossing number (graph theory) 5.
en:Herbert Grtzsch
en:Grtzsch's theorem (Grtzsch 1959), ,
3 .
,
, -en:null graph.
(Mycielski 1955), ,
.
. , ,
(Chvtal 1974).
(Hggkvist 1981)
(Erds, Simonovits 1973) ,
.
.
.
, .
10- 29 4,
, 4 n ,
n/3 .
, 5, 2, 4 2.
3- 3-k-- . 5
73
en:domination number 3.

D5 ,
, .

en:Chvtal graph, 4

ChvtalGraphs and combinatorics (Proc. Capital Conf., George Washington Univ., Washington, D.C., 1973).
Berlin: Lecture Notes in Mathematics, Vol. 406, Springer-Verlag. .243246..
On a valence problem in extremal graph theory // Discrete Mathematics. 1973. .4. .5.
.323334. DOI:10.1016/0012-365X(73)90126-X [1].
GrtzschZur Theorie der diskreten Gebilde, VII: Ein Dreifarbensatz fr dreikreisfreie Netze auf der Kugel //
Wiss. Z. Martin-Luther-U., Halle-Wittenberg, Math.-Nat. Reihe. 1959. .8. .109120..
HggkvistOdd cycles of specified length in nonbipartite graphs. .8999..
MycielskiSur le coloriage des graphs // Colloq. Math.. 1955. .3. .161162..
External links
Weisstein, Eric W. Grtzsch Graph [2](.) Wolfram MathWorld.

[1] http:/ / dx. doi. org/ 10. 1016%2F0012-365X%2873%2990126-X
[2] http:/ / mathworld. wolfram. com/ GroetzschGraph. html
74
en:Marion Cameron Gray
54
81
1296
en:semi-symmetric graph

c 54 81
. .
en:Marion Cameron Gray 1932 ( ), (Bouwer) 1968
, en:Jon Folkman 1967.
, ,
( ).
2, 3, 6.
3- 3- .

(Bouwer 1972) 27 333 27 , ,
. en:projective
configuration .
.
-, .
(Bouwer 1972) n 3, n-
, . . (Monson, Pisanski,
Schulte, Ivic-Weiss 2007)
4-.
75
(Marui, Pisanski 2000) .

, ,
, 8.
, , 7 (Marui, Pisanski, Wilson
2005).
s LCF en:LCF notation:

1296. ,
, ,
, . ,
, , ,
, , ,
. , en:semi-symmetric graph,
.

The ,
2. 3. .

An edge but not vertex transitive cubic graph // Bulletin of the Canadian Mathematical Society. 1968.
.11. .533535. DOI: 10.4153/CMB-1968-063-0 (http://dx.doi.org/10.4153/CMB-1968-063-0).
I. Z. BouwerOn edge but not vertex transitive regular graphs // Journal of Combinatorial Theory, Series B.
1972. .12. .3240. DOI: 10.1016/0095-8956(72)90030-5 (http://dx.doi.org/10.1016/
0095-8956(72)90030-5).
J. FolkmanRegular line-symmetric graphs // Journal of Combinatorial Theory. 1967. .3. .3.
.533535. DOI: 10.1016/S0021-9800(67)80069-3 (http://dx.doi.org/10.1016/S0021-9800(67)80069-3).
Dragan Marui, Toma PisanskiThe Gray graph revisited // Journal of Graph Theory. 2000. .35.
.17. DOI: 10.1002/1097-0118(200009)35:1<1::AID-JGT1>3.0.CO;2-7 (http://dx.doi.org/10.1002/
1097-0118(200009)35:1<1::AID-JGT1>3.0.CO;2-7).
Dragan Marui, Toma Pisanski, Steve WilsonThe genus of the Gray graph is 7 // European Journal of
Combinatorics. 2005. .34. .26. .377385. DOI: 10.1016/j.ejc.2004.01.015 (http://dx.doi.
76
org/10.1016/j.ejc.2004.01.015).
B. Monson, T. Pisanski, E. Schulte, A. Ivic-WeissSemisymmetric Graphs from Polytopes // Journal of
Combinatorial Theory, Series A. 2007. .3. .114. .421435. DOI: 10.1016/j.jcta.2006.06.007
(http://dx.doi.org/10.1016/j.jcta.2006.06.007)

Weisstein, Eric W. Gray Graph (http://mathworld.wolfram.com/GrayGraph.html)(.) Wolfram
MathWorld.
The Gray Graph Is the Smallest Graph of Its Kind (http://mathworld.wolfram.com/news/2002-04-09/
graygraph/), from MathWorld.
77
20
30
240 (S5 Z/2Z)
- 20
30 . . ,
,
en:partial cube .
" " , ,
en:bipartite half 20 .

:
G(10,3).

, . 20
10 ,
.
.
, .
78
, ,
-, . ,
17- , ,
. .
en:bipartite double cover

.
en:Kneser graph H5,2.

. ,
.
LCF en:LCF notation: [5,5,9,9]5.

,
. 240
5 2.

5 ,
, ,
. , ,
,
, .
,
2 , .
G(n,k) - , n=10
k=2 k21 (modn) - : (n,k)
=(4,1),(5,2),(8,3),(10,2),(10,3),(12,5),(24,5). ,
. G(4,1),
G(5,2), - G(8,3), G(10,2) en:Nauru graph
G(12,5).

, en:integral graph en:Spectral graph

theory .
79

.
.
en:pseudorotation .

6,
( A110507 OEIS).
en:partial cube.
2, 3, 5, 5 6.
3-- 3- .
- . .
,
, . 3. 2.

80

.

.
.

G = (V,E), () ().
, G .

(Tucker 1980) ,
. (McConnell 2003)
.

.
G , ,
, . ,
, , C5, C7, ..
.

, ,
.

( )
, .

81

, ,
en:Helly family. (Gavril 1974) ,
.
(Joeris, Lin, McConnell, Spinrad 2009) (
) , ,
O(n+m). ,
.
, , O(n).

en:resource allocation .
, .

Benson L. Joeris, Min Chih Lin, Ross M. McConnell, Jeremy P. Spinrad, Jayme L. SzwarcfiterLinear-Time
Recognition of Helly Circular-Arc Models and Graphs // Algorithmica. 2009. .2. .59.
.215239. DOI: 10.1007/s00453-009-9304-5 (http://dx.doi.org/10.1007/s00453-009-9304-5).
Alan TuckerAn efficient test for circular-arc graphs // SIAM Journal on Computing. 1980. .1. .9.
.124. DOI: 10.1137/0209001 (http://dx.doi.org/10.1137/0209001).
Ross McConnellLinear-time recognition of circular-arc graphs // Algorithmica. 2003. .2. .37.
.93147. DOI: 10.1007/s00453-003-1032-7 (http://dx.doi.org/10.1007/s00453-003-1032-7)
Algorithmic Graph Theory and Perfect Graphs. Academic Press, 1980. ISBN 0-444-51530-5 Second
edition, Annals of Discrete Mathematics 57, Elsevier, 2004.
Xiaotie Deng, Pavol Hell, Jing HuangLinear-Time representation algorithms for proper circular-arc graphs and
proper interval graphs // SIAM Journal on Computing. 1996. .2. .25. .390403. DOI:
10.1137/S0097539792269095 (http://dx.doi.org/10.1137/S0097539792269095).
Fanica GavrilAlgorithms on circular-arc graphs // Networks. 1974. .4. .4. .357369. DOI:
10.1002/net.3230040407 (http://dx.doi.org/10.1002/net.3230040407)

circular arc graph (http://www.graphclasses.org/classes/gc_133.html). Information System on Graph Class
Inclusions (http://www.graphclasses.org/index.html).
82

. ,
,
.

, :

. .
,
, , .
, , ,

.
, , K1,7 ,
, -
( 6). ,
K1,7 .

(Huson, Sen 1995),
.
. ,
en:omnidirectional antenna.
, ,
. ,
. ,
, .[1]

, ,
NP- (, en:existential theory of the
reals)[2]. ,
: ,
.
, , ,
en:dominating set,
,
83
, .
, , ,
.
,
. NP-
( , )
.

[1] , , .
[2] ; .

Heinz Breu, David G. KirkpatrickUnit disk graph recognition is NP-hard // Computational Geometry Theory and
Applications. 1998. .12. .9. .324..
Brent N. Clark, Charles J. Colbourn, David S. JohnsonUnit disk graphs // Discrete Mathematicsen:Discrete
Mathematics (journal). 1990. .13. .86. .165177. DOI: 10.1016/0012-365X(90)90358-O
(http://dx.doi.org/10.1016/0012-365X(90)90358-O).
Jesper Dall, Michael ChristensenRandom geometric graphs // Phys. Rev. E. 2002. .66. .016121.
DOI: 10.1103/PhysRevE.66.016121 (http://dx.doi.org/10.1103/PhysRevE.66.016121)
ariv:cond-mat/0203026.
Mark L. Huson, Arunabha SenMilitary Communications Conference, IEEE MILCOM '95. 1995. .2.
.647651. ISBN 0-7803-2489-7. DOI: 10.1109/MILCOM.1995.483546 (http://dx.doi.org/10.1109/
MILCOM.1995.483546).
Ross J. Kang, Tobias MllerProceedings of the Twenty-Seventh Annual Symposium on Computational
Geometry (SCG'11), June 1315, 2011, Paris, France. 2011. .308314..
Madhav V. Marathe, Heinz Breu, Harry B. Hunt, III, S. S. Ravi, Daniel J. RosenkrantzGeometry based heuristics
for unit disk graphs. 1994. ariv:math.CO/9409226.
Tomomi MatsuiApproximation Algorithms for Maximum Independent Set Problems and Fractional Coloring
Problems on Unit Disk Graphs // Lecture Notes in Computer Science. 2000. .1763. .194200.
ISBN 978-3-540-67181-7. DOI: 10.1007/978-3-540-46515-7_16 (http://dx.doi.org/10.1007/
978-3-540-46515-7_16).
Colin McDiarmid, Tobias, MuellerInteger realizations of disk and segment graphs. 2011. ariv:1111.2931
Yuichiro Miyamoto, Tomomi MatsuiPerfectness and Imperfectness of the kth Power of Lattice Graphs // Lecture
Notes in Computer Science. 2005. .3521. .233242. ISBN 978-3-540-26224-4. DOI:
10.1007/11496199_26 (http://dx.doi.org/10.1007/11496199_26).
Vijay Raghavan, Jeremy SpinradRobust algorithms for restricted domains // Journal of Algorithms. 2003.
.1. .48. .160172. DOI: 10.1016/S0196-6774(03)00048-8 (http://dx.doi.org/10.1016/
S0196-6774(03)00048-8).
84

,
,

. ,
.
.

. ,
,
,

. ,
,
, ,
. .

:

(Gerbracht 2009)
W7
,
4. Q4
.
85

,
,
,
, , .
, -
.

(itnik, Horvat, Pisanski 2010).
, ,
, , ,
-, (Gervacio, Lim,
Maehara 2008).
.
, W7,
,
.(Soifer 2008, . 94).
:
W7
n ? ,

(Erds 1946) n

, .
, .
,
,

$500 ,
(Kuperberg 1992). , ,
(Spencer, Szemerdi, Trotter 1984),
,
en:SzemerdiTrotter theorem .
86

A G,
A G (Maehara 1991)
(Maehara 1992).
en:BeckmanQuarles theorem p q, A,
en:Structural rigidity , p q ,
,
p q (Tyszka 2000). ,
( ),
. , ,
, en:graph automorphism (Beckman, Quarles
1953).

.
. (Maehara, Rdl 1990) , ,
, .
, ,
, ,
, . 2n
, ,
n2, , , ,
(Erds, Simonovits 1980).

NP- , , en:existential
theory of the reals, ,
(Schaefer 2013).

, , ,
.

F. S. Beckman, D. A., Jr. QuarlesOn isometries of Euclidean spaces // Proceedings of the American
Mathematical Society. 1953. .4. .810815..
Paul Erds On sets of distances of n points. American Mathematical Monthly. The American Mathematical
Monthly, 1946. .53. .248250. DOI:10.2307/2305092 [1].
Paul Erds, Mikls SimonovitsOn the chromatic number of geometric graphs // Ars Combinatoria. 1980.
.9. .229246.. Soifer 2008, .97.
Eberhard H.-A. GerbrachtEleven unit distance embeddings of the Heawood graph. 2009.
ariv:0912.5395.
87
Severino V. Gervacio, Yvette F. Lim, Hiroshi MaeharaPlanar unit-distance graphs having planar unit-distance
complement // Discrete Mathematics. 2008. .10. .308. .19731984.
DOI:10.1016/j.disc.2007.04.050 [2].
Greg KuperbergThe Erdos kitty: At least $9050 in prizes!. 1992..
Hiroshi MaeharaDistances in a rigid unit-distance graph in the plane // Discrete Applied Mathematics.
1991. .2. .31. .193200. DOI:10.1016/0166-218X(91)90070-D [3].
Hiroshi MaeharaExtending a flexible unit-bar framework to a rigid one // Discrete Mathematics. 1992.
.1-3. .108. .167174. DOI:10.1016/0012-365X(92)90671-2 [4].
Hiroshi Maehara, Vojtech RdlOn the dimension to represent a graph by a unit distance graph // Graphs and
Combinatorics. 1990. .4. .6. .365367. DOI:10.1007/BF01787703 [5].
Marcus Schaefer Thirty Essays on Geometric Graph Theory / Jnos Pach. Springer, 2013. .461482.
DOI:10.1007/978-1-4614-0110-0_24 [6].
Alexander Soifer The Mathematical Coloring Book. Springer-Verlag, 2008. ISBN 978-0-387-74640-1.
Joel Spencer, Endre Szemerdi, William T. Trotter Graph Theory and Combinatorics. Academic Press,
1984. .293308..
Apoloniusz TyszkaDiscrete versions of the Beckman-Quarles theorem // Aequationes Mathematicae. 2000.
.1-2. .59. .124133. DOI:10.1007/PL00000119 [7].
Arjana itnik, Boris Horvat, Toma PisanskiAll generalized Petersen graphs are unit-distance graphs.
2010. .1109..

Suresh VenkatasubramanianThe Open Problems Project..
Weisstein, Eric W. Unit-Distance Graph [8](.) Wolfram MathWorld.

[1] http:/ / dx. doi. org/ 10. 2307%2F2305092
[2] http:/ / dx. doi. org/ 10. 1016%2Fj. disc. 2007. 04. 050
[3] http:/ / dx. doi. org/ 10. 1016%2F0166-218X%2891%2990070-D
[4] http:/ / dx. doi. org/ 10. 1016%2F0012-365X%2892%2990671-2
[5] http:/ / dx. doi. org/ 10. 1007%2FBF01787703
[6] http:/ / dx. doi. org/ 10. 1007%2F978-1-4614-0110-0_24
[7] http:/ / dx. doi. org/ 10. 1007%2FPL00000119
[8] http:/ / mathworld. wolfram. com/ Unit-DistanceGraph. html
88

(.interest
graph)
,

[1].
,

,

[].
,
, ,
,
,
,
[][2]. .
, ,
, ,
.

.
, :
( )

, .

,
. , ,
.
[3]:
- ( )
- ( )
- ( )
, , ,
, ,
[4]
.
,
.
, , , ,
. ,
, , , ,
89
, , ,
[5].

,
[6].
[7]. Facebook
,
,
, .
, [8]
, ,
. , ,
, , .
,
-,
.
-.

. ,
, , Like Facebook LinkedIn,
, , ,
, , -.
[9].

, ,
. ,
.
,
[10].
,
[11], [12] ,
[6][10]. , Twitter
,
[13].
,
.
, , [14].
90

[1]
[2] Howard A. Tullman
[3] .., 2013
[4] Afra J. Mashhadi et al, 2009
[5] Leen-Kiat Soh et al, 2004
[6] Moataz Rashad
[7] , .
[8] , ,
.
[9] David Rogers
[10] Nadim Hossain
[11] Christopher Mims
[12] Brian Solis
[13] Sarah Perez
[14] J. O'Dell

How the Interest Graph will shape the future of the web (https://miter.mit.edu/
articlehow-interest-graph-will-shape-future-web/)(.). The MIT Entrepreneurship Review (01.04.2011).
30 2013.
Howard A. Tullman. Where Social Media Will Take Us in 2013 (http://www.inc.com/howard-tullman/
four-for-the-future.html?utm_source=feedburner&utm_medium=feed&utm_campaign=Feed:+inc/headlines+
(Inc.com+Headlines))(.). Inc.com (28.12.2012). 30 2013.
.. - (http://sisp.nkras.ru/p-ru/issues/2013/
1.pdf)(.) // : . , 2013.
1(13). .215. ISSN 2077-1770 (http://www.sigla.ru/table.jsp?f=8&t=3&v0=2077-1770&f=1003&
t=1&v1=&f=4&t=2&v2=&f=21&t=3&v3=&f=1016&t=3&v4=&f=1016&t=3&v5=&bf=4&b=&d=0&
ys=&ye=&lng=&ft=&mt=&dt=&vol=&pt=&iss=&ps=&pe=&tr=&tro=&cc=UNION&i=1&v=tagged&
s=0&ss=0&st=0&i18n=ru&rlf=&psz=20&bs=20&
ce=hJfuypee8JzzufeGmImYYIpZKRJeeOeeWGJIZRrRRrdmtdeee88NJJJJpeeefTJ3peKJJ3UWWPtzzzzzzzzzzzzzzzzzbzzvzzpy5
c8.NzrGJJvufeeeeeJheeyzjeeeeJh*peeeeKJJJJJJJJJJmjHvOJJJJJJJJJfeeeieeeeSJJJJJSJJJ3TeIJJJJ3..E.
UEAcyhxD.eeeeeuzzzLJJJJ5.
e8JJJheeeeeeeeeeeeyeeK3JJJJJJJJ*s7defeeeeeeeeeeeeeeeeeeeeeeeeeSJJJJJJJJZIJJzzz1..6LJJJJJJtJJZ4....
EK*&debug=false).
Afra J. Mashhadi, Sonia Ben Mokhtar, Licia Capra Habit: Leveraging Human Mobility and Social Network for
Efficient Content Dissemination in MANETs (http://www0.cs.ucl.ac.uk/staff/l.capra/publications/
wowmom09.pdf)(.) // In 10th IEEE International Symposium on a World of Wireless, Mobile and Multimedia
Networks (WoWMoM09). , , 2009. .4.
Leen-Kiat Soh, L.D. Miller, Todd Blank, Suzette Person ILMDA: Intelligent Learning Materials Delivery Agents
(http://digitalcommons.unl.edu/cgi/viewcontent.cgi?article=1104&context=csetechreports)(.) //
University of Nebraska Computer Science and Engineering. , 2004. .6.
Moataz Rashad. 5 Key Components of a Successful Interest Graph (http://mashable.com/2012/02/21/
interest-graph/)(.). Mashable (21.02.2012). 30 2013.
David Rogers. The Future of the Social Web: Social Graphs Vs. Interest Graphs (http://readwrite.com/2011/
09/30/the_future_of_the_social_web_social_graphs_vs_interest_graphs#awesm=~oqKAzGlfQ06ppV)(.).
Readwrite.com (30.09.2012). 30 2013.
91
Nadim Hossain. Why the Interest Graph Is a Marketers Best Friend (http://mashable.com/2012/06/19/
interest-graph-marketer/)(.). Mashable (19.06.2012). 23 2013.
Christopher Mims. Yahoos plan for a turnaround: juice its advertising revenue by reading your mind (http://qz.
com/18492/yahoos-plan-for-a-turnaround-juice-its-advertising-revenue-by-reading-your-mind/)(.). Quartz
(23.10.2012). 23 2013.
Brian Solis. The Interest Graph on Twitter is Alive: Studying Starbucks Top Followers (http://www.briansolis.
com/2011/02/the-interest-graph-on-twitter-is-alive-studying-starbucks-top-followers/)(.). Brian Solis
(08.02.2011). 23 2013.
Sarah Perez. How Twitter Is Pairing Its Interest Graph With Ads (http://techcrunch.com/2012/03/01/
how-twitter-is-pairing-its-interest-graph-with-ads/)(.). TechCrunch (01.03.2012). 30 2013.
J. O'Dell. What the heck is an interest graph? Pearltrees raises $6.6M to show us (http://venturebeat.com/2012/
02/13/pearltrees-funding-interest-graph/)(.). VentureBeat (13.02.2012). 23 2013.
92
16
40
1920

-
-
-
, 16
. 40 5- , 80
10- . 80- - en: 5-
. (Seidel,1968)[1]
, 1868 . 40-
en:folded cube graph 5 .
,
R(3,3,3)=17. [2]
93

5- (5- )
4- . ( n-
, n .)
5- .
, ,
GF(16)
.
5- (10- ) 5- .
5- ,
. 16 ,
. 10- .

5- 5-
.[3] , 10- , .
5- , .
5- en:k-vertex-connected graph 5- en:k-edge-connected graph ,
, - ,
.
K16 5- .
, ,
K16. , R(3,3,3),
, 17.
R(3,3,3)=17
5- en:Keller's conjecture ,
,
, .

5- .
, en:integral graph en:Spectral graph theory
.
.
5- c 1920,
. ,
, - ,
- -.
94
8.
. 4. 5.

[1] J. J. Seidel, Strongly regular graphs with (1,1,0) adjacency matrix having eigenvalue 3, Lin. Alg. Appl. 1 (1968) 281-298.
[2] The Clebsch Graph on Bill Cherowitzo's home page (http:/ / www-math. ucdenver. edu/ ~wcherowi/ courses/ m6023/ shilpa. pdf)
[3] Peter J. Cameron Strongly regular graphs (http:/ / designtheory. org/ library/ preprints/ srg. pdf) on DesignTheory.org, 2001
95
18 , . , ,
. , , ,
.
6
( ) , .[1]
en:incidence geometry
en:Configuration (geometry) ,
(
). en:F. W. Levi, 1942 .
: 4
, . ,

. en:biregular graph,

.
,
.
, .

, 10 10 .
3 3 .
G(10,3) en:Kneser
graph 5,2. 3- 20 .
en:Fano plane. (3,6)-
3- 14 .
, 8 8
, .
3- 16 .
, 9 9 .
3 3 .
3- 18 .
96
, R3 333 27
27 , .
8- .
(3,8)-, 3- 30 .
Q4 ,
. ,
, (
).
en:Ljubljana graph 112 .

[1] . , , . 181 (http:/ / books. google. com/ books?id=cKpBGcqpspIC& pg=PA181).

Weisstein, Eric W. Levi Graph (http://mathworld.wolfram.com/LeviGraph.html)(.) Wolfram
MathWorld.
97
24
36
32
, (3-7)-, 3- 24 36
.
(3,7)- ( 7).
, .
(Sachs), ,[1] ,
1960.[2] , 1966, , (3,7)-.[3][4][5]
18 ( A110507 OEIS).
8 . 5
24 8.[6] G(12,5),
en:Nauru graph.
4, 4, 3 3.
3-- 3--.

.
32
8 16. ,
-.[7]
98
8. The
3. 3.
3.

[1] Krteszi, F. "Piani finit ciclici come risoluzioni di un certo problemo di minimo." Boll. Un. Mat. Ital. 15, 522-528, 1960
[2] McGee, W. F. "A Minimal Cubic Graph of Girth Seven." Canad. Math. Bull. 3, 149-152, 1960
[3] Tutte, W. T. Connectivity in Graphs. Toronto, Ontario: University of Toronto Press, 1966
[4] Wong, P. K. "Cages--A Survey." J. Graph Th. 6, 1-22, 1982
[5] Brouwer, A. E.; Cohen, A. M.; and Neumaier, A. Distance Regular Graphs. New York: Springer-Verlag, p. 209, 1989
[6] Pegg, E. T. and Exoo, G. "Crossing Number Graphs." Mathematica J. 11, 2009
[7] Bondy, J. A. and Murty, U. S. R. Graph Theory with Applications. New York: North Holland, p. 237, 1976.
99
16
24
96

en:
16
24 , (18571903).
G(8,3). ,
, ,
.
100

(Mbius 1828) ,
p , ,
,
, . ,

en:projective configuration. p = 4

, (Kantor
1882)
, en:complex projective
plane. , .
p = 4,
, .
, .
, ,
, , .

[1]. ,
,
.

, en:Crossing
number (graph theory) 4,

( A110507 OEIS).
, ,

.
en:toroidal graph
,
[2].

en:Turn graph K2,2,2,2.

en:Genus-2 surface,
, . ,

, 96 ,
,
,
.
101
. (Coxeter 1950) (Threlfall 1932). 96-

, . (Tucker
1984) , . (DeWitt Godfrey)
(Duane Martinez)
2007.
2013 .
en:triple torus ( ),
en:regular map (graph theory), 12- ; [2].
(Lijnen, Ceulemans 2004), ,
. ,
759 .

96.[3]
, . ,
.
16
, -.[4]
.
G(n,k) - ,
n=10 k=2 k21 (modn), - : (n,k) =
(4,1), (5,2), (8,3), (10,2), (10,3), (12,5), (24,5) (Frucht, Graver, Watkins 1971). ,
.
, [5].
,
, , en:Nauru graph .

en:Pauli group

[1] Coxeter, 1950
[2] Marui, Pisanski, 2000
[3] Royle, G. F016A data (http:/ / www. csse. uwa. edu. au/ ~gordon/ foster/ F016A. html)
[4] , Dobcsnyi, P. "Trivalent Symmetric Graphs Up to 768 Vertices." J. Combin. Math. Combin. Comput. 40, 41-63, 2002.
[5] McMullen, 1992
102

H. S. M. CoxeterSelf-dual configurations and regular graphs // Bulletin of the American Mathematical Society.
1950. .5. .56. .413455. DOI: 10.1090/S0002-9904-1950-09407-5 (http://dx.doi.org/10.
1090/S0002-9904-1950-09407-5).
R. Frucht, J. E. Graver, M. E. WatkinsThe groups of the generalized Petersen graphs // Proceedings of the
Cambridge Philosophical Society. 1971. .02. .70. .211218. DOI:
10.1017/S0305004100049811 (http://dx.doi.org/10.1017/S0305004100049811).
S. Kantorber die Configurationen (3, 3) mit den Indices 8, 9 und ihren Zusammenhang mit den Curven dritter
Ordnung // Sitzungsberichte der Mathematisch-Naturwissenschaftlichen Classe der Kaiserlichen Akademie der
Wissenschaften, Wien. 1882. .1. .84. .915932..
E. Lijnen, A. CeulemansOriented 2-Cell Embeddings of a Graph and Their Symmetry Classification: Generating
Algorithms and Case Study of the Mbius-Kantor Graph // J. Chem. Inf. Comput. Sci.. 2004. .5.
.44. .15521564. DOI: 10.1021/ci049865c (http://dx.doi.org/10.1021/ci049865c) PMID
15446812..
Dragan Marui, Toma PisanskiThe remarkable generalized Petersen graph G(8,3) // Math. Slovaca.
2000. .50. .117121..
Peter McMullenThe regular polyhedra of type {p, 3} with 2p vertices // Geometriae Dedicata. 1992.
.3. .43. .285289. DOI: 10.1007/BF00151518 (http://dx.doi.org/10.1007/BF00151518).
A. F. MbiusKann von zwei dreiseitigen Pyramiden eine jede in Bezug auf die andere um- und eingeschrieben
zugleich heissen? // J. Reine Angew. Math.. 1828. .3. .273278.. Gesammelte Werke (1886),
1, 439446.
Thomas W. TuckerThere is only one group of genus two // Journal of Combinatorial Theory, Series B.
1984. .3. .36. .269275. DOI: 10.1016/0095-8956(84)90032-7 (http://dx.doi.org/10.1016/
0095-8956(84)90032-7).
W. ThrelfallGruppenbilder // Abhandlungen der Mathematisch-Physischen Klasse der Schsischen Akademie der
Wissenschaften. 1932. .6. .41. .159..
Unveiling of the sculpture.

Weisstein, Eric W. Mbius-Kantor Graph (http://mathworld.wolfram.com/Moebius-KantorGraph.html)(.)
Wolfram MathWorld.
Weisstein, Eric W. Mbius-Kantor Configuration (http://mathworld.wolfram.com/
Moebius-KantorConfiguration.html)(.) Wolfram MathWorld.
103

,
,
,

,
, ,
,

,
. , .
(
1988 ).
.
en:Michael
Fellows .
" ".
,
, . .

(M. Koebe) [1],
. (M. Pergel) (J.
Kratochvl).[2]

[1] M. Koebe. On a new class of intersection graphs in Proceedings of the Fourth Czechoslovak Symposium on Combinatorics Prachatice, pages
141143, 1990.
[2] M. Pergel. Special Graph Classes and Algorithms on Them. Doctoral Thesis, 2007.
J. P. Spinrad. Efficient Graph Representations. American Mathematical Society, 2003.

104

( ) ,
, ,
(deadlock). , ,
:
, .
.
, , .
.
:
, - - , ,

, - - ,
, .

1. , , .
2. - ,
( ) ,
.
3. ,
() , ,
, .
,
.

, [1]

[1] http:/ / www. belani. narod. ru/ 1/ tupik. htm
105
18
27
216

-
-
3- 18
27 , .
, , , ,
. - .
.[1]
en:Crossing number (graph theory) 5,
( A110507
OEIS). 6, 4, 4, 2, 3,
3-, 3-.
en:chromatic polynomial
.
,
, .
6- .
, en:regular map (graph theory)
106
. 18
.

216.
. , . ,
.
F018A 18 .[2][3]
.
, .

[1] Brouwer, A. E.; Cohen, A. M.; and Neumaier, A. Distance-Regular Graphs. New York: Springer-Verlag, 1989.
[2] Royle, G. Cubic Symmetric Graphs (The Foster Census). (http:/ / www. cs. uwa. edu. au/ ~gordon/ remote/ foster/ #census)
[3] and Dobcsnyi, P. Trivalent Symmetric Graphs Up to 768 Vertices. J. Combin. Math. Combin. Comput. 40, 41-63, 2002.
107
13-
q 1 mod 4, q
q(q 1)/4
QR(q)
( ),
,
, en:quadratic residue.
,
.
,
.

(,1933). (Sachs, 1962)
(Erds, Rnyi, 1963) . (Horst Sachs) - ,
.

. (, , , )
, :
- .
108

q , q = 1 (mod 4). ,
1 Fq , q.
V = Fq
.
, ab =(ba), 1 ,
, ab , ba .
G=(V,E) q.

q = 13 Fq 13. , 13:
1 ( 1 +1, 5 1)
3 ( 4 +3, 6 3)
4 ( 2 +4, 3 4).
, , [0,12]
x : x1(mod13), x3(mod13), x4(mod13).
, , , .
( 1) (
) en:quadratic Gauss
sum.
q , i(G) :
, i(G)~O(q), .
q , .
( ., 1989) ,
, ( q) , ,
, .
109

17- G, ,
4- ( ., 1981). ,
R(4,4)=18.
101- G, G,
6- .

-en:HorrocksMumford bundle.

q , q = 3 (mod 4). Fq q
1. , (a,b) Fq a b, b a,
, . V = Fq

,
.

en:biplane geometries.

13- ,
en:Neighborhood (graph theory). ,
, .
, - q ,
,
. (Bojan Mohar, 2005) ,
, , - , q
, , . , ,

o(1) q, q .
(White, 2001) q1(mod8)
9- .
, .
110

Baker, R. D.; Ebert, G. L.; Hemmeter, J.; Woldar, A. J.Maximal cliques in the Paley graphs of square order // J.
Statist. Plann. Inference. 1996. .56. .3338. DOI: 10.1016/S0378-3758(96)00006-7 (http://dx.
doi.org/10.1016/S0378-3758(96)00006-7)
Broere, I.; Dman, D.; Ridley, J. N.The clique numbers and chromatic numbers of certain Paley graphs //
Quaestiones Mathematicae. 1988. .11. .9193. DOI: 10.1080/16073606.1988.9631945 (http://
dx.doi.org/10.1080/16073606.1988.9631945)

Brouwer, Andries E. Paley graps (http://www.win.tue.nl/~aeb/drg/graps/Paley.html)(
(http://web.archive.org/web/*/http://www.win.tue.nl/~aeb/drg/graps/Paley.html)).
Mohar, Bojan. PaleyGenus.html Genus of Paley graps (http://www.fmf.uni-lj.si/~mohar/Problems/P0506_)
(2005).

,
en:representation (mathematics)
.
,
,
.

(McKee, McMorris 1999).

,
.

G
G , , .
. ,
(Erds, Goodman, Psa 1966) (
), , n
. , ,
(Szpilrajn-Marczewski 1945), (ulk 1964).
en:Intersection number (graph theory)
111

,
, , :
,
-.
.
,
.
,
.
,
. en:permutation graph, ,
, en:comparability graph,
.
.
en:circle packing theorem ,
( ) .
en:Scheinerman's conjecture ( ) ,
. ,
,
en:Complete (complexity) en:existential
theory of the reals (Schaefer 2010).
G G,
.
en:string graph .
en:boxicity k
en:Hyperrectangle k, .

en:containment order.
,
, , f
, x y
, .
112

K. ulk Theory of Graphs and its Applications (Proc. Sympos. Smolenice, 1963). Prague: Publ. House
Czechoslovak Acad. Sci., 1964. .1320..
Paul Erds, A. W. Goodman, Louis PsaThe representation of a graph by set intersections // Canadian Journal of
Mathematics. 1966. .18. .106112. DOI:10.4153/CJM-1966-014-3 [1].
0-12-289260-7.
Topics in Intersection Graph Theory. Philadelphia: Society for Industrial and Applied Mathematics, 1999.
.2. (SIAM Monographs on Discrete Mathematics and Applications). ISBN 0-89871-430-3
E. Szpilrajn-MarczewskiSur deux proprits des classes d'ensembles // Fund. Math.. 1945. .33.
.303307..
Marcus Schaefer Graph Drawing, 17th International Symposium, GS 2009, Chicago, IL, USA, September 2009,
Revised Papers. Springer-Verlag, 2010. Vol.5849. .334344. (Lecture Notes in Computer
Science). ISBN 978-3-642-11804-3 DOI:10.1007/978-3-642-11805-0_32 [2].

Jan Kratochvl, A video lecture on intersection graphs (June 2007) [3]
E. Prisner, A Journey through Intersection Graph County [4]

[1] http:/ / dx. doi. org/ 10. 4153%2FCJM-1966-014-3
[2] http:/ / dx. doi. org/ 10. 1007%2F978-3-642-11805-0_32
[3] http:/ / videolectures. net/ sicgt07_kratochvil_gig/
[4] http:/ / www. eprisner. de/ Journey/ Rahmen. html
113

. ,
.

.
,
5-. 10 15 .
, ,
,
(). . S5.

S5.

, ,
.
3.
( ) 4, ,
1-,
.[1]

.

.

[1] . . 113

. . .: , 2003. 300 . ISBN 5-354-00301-6.
. . .: , 2008. 352 . ISBN 978-5-397-00044-4.
114

( ), .
S
S
Ti Tj Ti Tj.
S, T1 T2, T1 T2,
A1 T1 A2 T2, :
A1 A2
A1 A2
A1 A2
, -.

Time T1 T2 T3
1 read(A)
2 write(A)
3 Commit
4 write(A)
5 Commit
6 write(A)
7 Commit
. :
S: r1(A);w2(A);w1(A);w3(A);
r1(A) T1 w2(A) T2. , T1
T2. , T2 T3.
:
, , -
.
.
115
Time T1 T2 T3
1 read(A)
2 write(A)
3 read(B)
4 Commit
5 write(B)
6 Commit
7 write(A)
8 Commit
S: r1(A);w2(A);r2(B);w1(B);w3(A);
T1 T2, , T2 T1. , ,
, -.

, 5- [1],
17 .
basic precedence graph generator [2] by Laurens Sttzel, University of Duisburg-Essen, Germany

[1] http:/ / portal. acm. org/ citation. cfm?id=1202608& dl=GUIDE& coll=GUIDE& CFID=9802819& CFTOKEN=82728908
[2] http:/ / www-stud. uni-due. de/ ~selastoe/ ?mdl=dbms& mode=precedence
116

(
) R,
G
v Gv
R

G R. ,

.

,

, ,
, .

.
. x y (x<y) x-
y . , , 0
, 1 0 ( ,
1 ) , 2 3 4.

:
U V x, U V. ,
x U. x
, V x , x- V .
, x V.
,

G, . Gi G,
i , Gi S
. v G U v Gi. V
, v Gi. x ,
U V, S{x} , Gi+1.
, , ,
.
117

, , ,
. G H . Gi Hi
G H . gi hi G H
, Gi Hi. , ,
Gi+1 Hi+1, gi hi
. ,
, , , G H. ,
-en:back-and-forth method, G H .
, ,

. , ,
, .

G
,
U V ,
U V, . G V
. ,
, .

A B,
, .
:
, , ,
Ui Vi, . Ui Vi
, ,
.
, . ,
. .
, .

, , ,
. , ..

en:ErdsRnyi model
1/2 , .
1 , .
, 1/2. p, 0
1. , 1963,[]
the random graph ( )
- ,
118
.
, .
, ,
. , 1 4,

( , 1 4,
, ). , U V,
, , U
V ,
- .

,
,
. [1] .
, .
.
- . ,
, ,
.
, - G , ,

. G1.
.
en:saturated model.
[2] .

[1] . .
[2] . .

Peter J. CameronThe mathematics of Paul Erds, II. Berlin: Springer, 1997. .14. .333351..
Peter CameronThe random graph. 2013. ariv:1301.7544
119

,

. [1]

,
, .

.
, ,

.
.
,

.
.
, .
.
.

:
- f,
.
. . :
1 f 0 n.
, , f,
1 n-1, 2 3.
, , 1, 2, 3
4.
, f,
, 0, 1, n-1 n, 2.
, :
k n-k. ,
.
120

[2]
[3]
, , , ,
:
,

.

[1] G. Reeb, Sur les points singuliers dune forme de Pfaff compltement intgrable ou dune fonction numrique. C.R.A.S. Paris 222, 1946,
pp.847849. (http:/ / gallica. bnf. fr/ ark:/ 12148/ bpt6k31740. image. r=comptes+ rendus+ de+ l. f847. pagination. langFR)
[2] .. . // . 2003. . 55.
5. . 687700.
[3] .., .., , , ., 1997.
121
en:William Thomas
Tutte

30
45
1440 (Aut(S6))

en:Moore graph
-
-
( 8- ) 3- 30 45 .
8,
en:Moore graph.
en:generalized quadrangle W2 ( ).
(.William Thomas Tutte) .
(Tutte 1947),
(Tutte 1958, Coxeter (a) 1958).
- [1].
,
(Coxeter (b)
1958), (Sylvester 1844).
(, a, b, c, d, e, f). 15
: ab, ac, ad, ae, af, bc, bd, be, bf, cd, ce, cf, de, df, or ef.
: (ab, cd, ef); (ab, ce, df); (ab, cf, de); (ac, bd, ef); (ac, be, df); (ac, bf, de); (ad, bc, ef); (ad,
be, cf); (ad, bf, ce); (ae, bc, df); (ae, bd, cf); (ae, bf, cd); (af, bc, de); (af, bd, ce); (af, be, cd).
122
, .
, ,
, , .
, , .
1440 ,
(Coxeter (b) 1958).
, .
,
. , en:outer automorphism
. ,
(
).
13.
2. 3.

[1] Brouwer, A. E.; Cohen, A. M.; and Neumaier, A. Distance-Regular Graphs. New York: Springer-Verlag, 1989.

H. S. M. CoxeterThe chords of the non-ruled quadric in PG(3,3) // Canad. J. Math.. 1958. .10.
.484488. DOI: 10.4153/CJM-1958-047-0 (http://dx.doi.org/10.4153/CJM-1958-047-0)
H. S. M. CoxeterTwelve points in PG(5,3) with 95040 self-transformations // Proceedings of the Royal Society
A. 1958. .1250. .247. .279293. DOI: 10.1098/rspa.1958.0184 (http://dx.doi.org/10.
1098/rspa.1958.0184)
J. J. SylvesterElementary researches in the analysis of combinatorial aggregation // The Philos. Mag., Series 3.
1844. .24. .285295.
W. T. TutteA family of cubical graphs // Proc. Cambridge Philos. Soc.. 1947. .04. .43.
.459474. DOI: 10.1017/S0305004100023720 (http://dx.doi.org/10.1017/S0305004100023720)
W. T. TutteThe chords of the non-ruled quadric in PG(3,3) // Canad. J. Math.. 1958. .10.
.481483. DOI: 10.4153/CJM-1958-046-3 (http://dx.doi.org/10.4153/CJM-1958-046-3)
123

Franois Labelle. 3D Model of Tutte's 8-cage (http://www.cs.berkeley.edu/~flab/proto/report/report.html).
Weisstein, Eric W. Levi Graph (http://mathworld.wolfram.com/LeviGraph.html)(.) Wolfram
MathWorld.
Exoo, G. Rectilinear Drawings of Famous Graphs. (http://isu.indstate.edu/ge/COMBIN/RECTILINEAR/)
124
12
18
1 ()
3- 12 18
. en:Robert Frucht 1939.
3, 3, 3,
4 3. , , 3--
en:polyhedral graph. k- .
5.
LCF en:LCF notation
[5,2,4,2,5,2,2,5,2,5,4,2].

,
[1] ( , ).
. en:Frucht's theorem ,
, , , ,
3-
.

.
125
3. .

[1] Skiena, S. Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Reading, MA: Addison-Wesley, 1990

. ,
,
. ,
. ,
.[1]
en:Rudolf Halin,
1971,
en:Thomas Kirkman.
.
126

.
en:graph embedding
, ,
( ,
).
, ,
.

.
, .
en:triangular prism
,
,
,
.
,
en:graph automorphism,
.

3-, ,
. 3-, ,
3-. en:Steinitz's theorem, 3- ,
.
, en:polyhedral graph. ,
, ,
.
.
, .
2 , .
, , . ,
en:pancyclic graph, ,
3 n . ,
,
.
. , ,
NP- , ,
.
127
,
, (
, ).
en:outerplanar graph.

,
.

1971 (Halin) ( )
en:minimal element 3--
. , ,
, ,
, ..
en:graph enumeration 1856
en:Thomas Kirkman, 1965 en:Hans Rademacher.
. en:polyhedral
graph f , f 1 . ,
.
,
. ,
, .

[1] Encyclopaedia of Mathematics, first Supplementary volume, 1988, ISBN 0-7923-4709-9, p. 281, Halin Graph (http:/ / books.
google. com/ books?id=3ndQH4mTzWQC& pg=PA281& dq="halin+ graph"+ -wikipedia& ei=RgLsSKP2A5DetAPHydj2Bg&
sig=ACfU3U3IK1TmaSTLW3yoIHaMUJvE3rKFIQ)

Halin graphs (http://wwwteo.informatik.uni-rostock.de/isgci/classes/gc_198.html), Information System on
Graph Class Inclusions.
Weisstein, Eric W. Halin Graph (http://mathworld.wolfram.com/{{{urlname}}}.html)(.)
Wolfram MathWorld.
128
14
21
336 (PGL2(7))

-
-
en:Toroidal
graph

14 21 ,
en:Percy John Heawood.

.
, (3,6)-,
6. - ( ,
-. 24 , ,
, . , ,
, .
, ( ,
3- ) .
.
28 , .
6- .
129
. , , 6 ,
en:Coxeter graph.

en:toroidal graph. ,
.
,
en:Szilassi polyhedron. en:Percy John Heawood,
1890, .
, , .
en:Fano plane, ,
. , 6
. en:Crossing number (graph theory),
3, (
A110507 OEIS). 8 14
3. ,
,
.
, .

PGL2(7), 336.
, . .
,
. , F014A,
14 [1][2].
.
, .

.
3. 3. 2.
130

( ),

-

[1] Royle, G. ( ). (http:/ / www. cs. uwa. edu. au/ ~gordon/ remote/ foster/ #census)
[2] Dobcsnyi, P. Trivalent Symmetric Graphs Up to 768 Vertices. J. Combin. Math. Combin. Comput. 40, 41-63, 2002.
131
8 8
nm
4mn - 6(m + n) + 8
4 ( n 3, m 5)
,
, .
.
, .
.
(Schwenk) , .

132
8 8
nm
4nm - 3(n + m) + 2
,
,
.[1]
.
, .
.
( ,
)
.

[1] . .341 (http:/ / books. google. com/ books?id=w0rmms0_hMMC& pg=PA341).
133
27
216
16- 27 216
. . srg(27, 16, 10, 8).

27 en:cubic surface
. , ,

(1, 0, 0, 0, 0, 0, 1, 0),
(1, 0, 0, 0, 0, 0, 0, 1),
(1/2, 1/2, 1/2, 1/2, 1/2, 1/2, 1/2, 1/2),
24 , . 27
. ,
1.

16 ,
10 ( 16 10 ,
). [1].
, .
, .
27
en:Configuration (geometry) en:Schlfli double six 12
, . , uv
, K6 K2,
134
u v K6 . 36
, 0 1
, .

k-en:Ultrahomogeneous graph,
, k ,
. 5-, k.
, en:Turan graph, 3 3 5
. . ,
4-, 5- .
.

[1] , ,
, .

Weisstein, Eric W. Schlfli Graph (http://mathworld.wolfram.com/SchlaefliGraph.html)(.)
Wolfram MathWorld.
Andries E. Brouwer page. (http://www.win.tue.nl/~aeb/graphs/Schlaefli.html)
-
- ()
,
,
() ,
, .
, ,
..
-
(),
/,
. [1][2]
: (
), , (
), .
, ,
. ,
. - ,
, . ,
,
, ,
- 135
.
- ,
: ( ) (,
, , -, ).
- ,
.

[1] .., .., .. [ .] . : -
, 1999. 368 . ISBN 5-7277-0253-4
[2] .., .., .. [ .] -
. , - , 2010. 200 . ISBN
978-5-7681-0523-5

.. (- ). .: , 1979. 232 .
.., .. . .: , 1989. 328 .
. . ..
. .: , 1986. 400 .
(http://www.pntd.ru/19.701.htm)
- 136
2n (Dn)
3 n 2,
3 n 2,
[1]
{2 cos(2 k / n), k=1, ... ,n}
2-

- , , , ,
, . - n Cn.
Cn 2,
.

- . - ,
, ,
. , n-.
, .

-:

2-

.
( ) (, 1936).
- 137
-2- .
- 3 -3- .

:
- , n
, n ,
2n. , ,
, n- .
-
-
-,
.
,
,
en:feedback arc set. ,
,
,
en:feedback vertex set.
- 1
- 8
1.
-
(., , (Trevisan)).

( )

[1] Some simple graph spectra (http:/ / www. win. tue. nl/ ~aeb/ 2WF02/ easyspectra. pdf). win.tue.nl

Weisstein, Eric W. Cycle Graph (http://mathworld.wolfram.com/CycleGraph.html)(.) Wolfram
MathWorld. ( 2- -,
en:cycle diagram)
en:Luca Trevisan, Characters and Expansion (http://in-theory.blogspot.com/2006/12/
characters-and-expansion.html).
138

,
;
,
. ,
.
"" ,
H G, G H (
, G ). G' G
.
- ( )
.

:
.

.
G
G G, G
G.

,

().
,
6 (
). , 3-,
, ,

.[1]
,
, , .
, .
, . ,
.
139

G . G G, G G
, G G G
G. ,
( ).
en:Whitney's planarity criterion,
, .
: M en:graphic
matroid G, en:dual matroid M
, G . G ,
G .

,
.
en:outerplanar graph , ,
,
. G, G+ ,
v G v
( , ).
G () G+ .

[1] , Planar Graphs, Theorem 10.28
Weisstein, Eric W. Dual graph (http://mathworld.wolfram.com/DualGraph.html)(.) Wolfram

MathWorld.
Weisstein, Eric W. Self-dual graph (http://mathworld.wolfram.com/Self-DualGraph.html)(.)
Wolfram MathWorld.
140

, ,
,
- -
, ,
.

,

, , , ,

(
, .., ,
),
.

. , ,
. :

.
, .
141

, .
2.
, 2- (
)
,
( ).
, 2 , .

, ,

(, )
(. ).
, ,

.

Factor graph
Tanner graph

, [1]

[1] http:/ / compscicenter. ru/ program/ lecture/ 6623|
142

"" , ,
. , .
2-
, 2-.
,
.
( ),
.

,
( ).
, v w
v w, v w.
( 2-) ( ) n (
A002218 OEIS)

1 0
2 1
3 1
4 3
5 10
6 56
7 468
8 7123
9 194066
10 9743542
11 900969091
12 153620333545
13 48432939150704
14 28361824488394169
15 30995890806033380784
16 63501635429109597504951
17 244852079292073376010411280
18 1783160594069429925952824734641
19 24603887051350945867492816663958981
143

( )

Eric W. Weisstein. "Biconnected Graph." From MathWorld--A Wolfram Web Resource. http://mathworld.
wolfram.com/BiconnectedGraph.html
Paul E. Black, "biconnected graph", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed.,
U.S. National Institute of Standards and Technology. 17 December 2004. http://www.nist.gov/dads/HTML/
biconnectedGraph.html

The tree of the biconnected components Java implementation [1] in the jBPT library (see BCTree class).

[1] http:/ / code. google. com/ p/ jbpt/

, :
;
();
, ;
, :
() ( ) ;
.
,
.
, :
,
-. .
, y .
x x0 x0
O(h) . -
.
:
: -
y.
O(n) . , , .
144

,
- treap,
- (heap) (tree)
. treap (+).
.

(x, y)
. x
y:
y(1), y(2), y(3), , y(n).
y. y(k). . y(k)
y :
y(1), , y(k1); y(k+1), , y(n).
y y(k) . 4
( ) .
: y
. y ,
.
:
T( y(1), ..., y(n) ) = root: y(k)

left_tree: T( y(1), ..., y(k1) )
right_tree: T( y(k+1), ..., y(n)) )
where y(k) = min( y(1), ..., y(n) )
, (x, y) .
, ,
.
( ) ,
. .

.
y . T(y(1), , y(k+1)) T(y(1), ,
y(k)) y(k+1).
T( y(1), ..., y(k+1) ) = F ( T( y(1), ..., y(k) ), y(k+1) )
. .
, y x.
, x .
x.
F, T(y(1), , y(k)) y(k+1)
T(y(1), , y(k+1)), . y(k+1) .
145
. , y(k+1)
y(k) , y(k+1) > y(k).
y(k) y, . ,
, y , y(k+1), y(k+1) ,
y(k+1).
( ) ( ) .
, - , ,
. ,
.

neerc.ifmo.ru/wiki (http://neerc.ifmo.ru/wiki/index.
php?title=_)
neerc.ifmo.ru/wiki (http://neerc.ifmo.ru/wiki/index.
php?title=____)
C# habrahabr.ru 1 (http://habrahabr.ru/post/101818/),
2 (http://habrahabr.ru/post/102006/), 3 (http://habrahabr.ru/post/102364/)
C++ e-maxx.ru (http://e-maxx.ru/algo/treap)

Seidel, Raimund; Aragon, Cecilia R. Randomized Search Trees (http://people.ischool.berkeley.edu/
~aragon/pubs/rst96.pdf), 1996.
( ) 146
( )
. ,
, .
() ( ,
), ( ),
1 ( ).
, ( )
.
, ( ).
:
1.
2. ( )
, ;

(, , ).
(, ) 1 ( ,
; ,
).
.
. :
1. 0;
2. , ,
.
.
- , .
: ,
(!) , .
.
, ,
.
() ,
. , , .
, 2.
( ),
.
( ) 147

( )
:
,
3.
,
( ) 2.
,
.
, , ,
- , -, . 9
3, 2.
.
N-
N- .
, .
N- () (, ),
N+1.
N- () ,
( ) N.

.
. ,
, , , .
,
.
( )
( 1) .
. ,
, .
, .

, ,
[1]
( ).

( ) 148
, , .

. , , .
, ,
. ,
(
). , ,
. ( )
, .
. ,
:

[1] : . (http:/ / rain. ifmo. ru/ cat/ view. php/ theory/ graph-general/ cayley-2008/ )

. , = The Art of Computer Programming, vol. 1. Fundamental
Algorithms. 3- . .: , 2006. .1. . 720. ISBN
0-201-89683-4
. . 2- . .: , 1980. 336.
. . .: , 1973. 302.
149

. Z-.
,
. (
) : .
,
, .
.
, . ,
.

,
.
.

,
:
1D:
2D:
2D:
3D:
= ; ;
.
150

,
( , ; ).
G=(V,E) V E. .

d(w,v) . v.
,
-, -, ,
v.
, ,

.
:

; ,
. , (
) ( ).
.
, .
( ),
( ),
.

,
. ,

.
, ,
.
151

, . , P
, :
, .
, H .
;
.
,
.
: , 1, v=w, 0 .
, v,

[1]

[1] http:/ / www. yann-ollivier. org/ specgraph/ specgraph. html
- 152
-
- , ,
v w, j v k w j k i = d(v,
w).
, k = 1 - v w,
i, , w j v, .
, , ,
.[1] , -
, bi,ci,i=0,...,d, x,y G
i=d(x,y), ci y Gi-1(x) bi y Gi+1(x), Gi(x) y
G d(x,y)=i (Brouwer ., .434). , - ,
.
- . ,
- -
,
.
- 2 , (
, ).

- G.
n. w ( , w), v i, i + 1, i 1
ai, bi, ci, . G. , a0 = 0, c0 = 0, b0
k, . G , d bd = 0.
ai+bi+ci= k ai, bi, ci
G.

.
- 153

, G - . i = 1, ..., d,
Gi, , G i.
Ai Gi. , A1 A G. , A0 = I
. d + 1 A0, A1, ..., Ad, G.
J, 1. :
, Ai A i, A
d + 1.
, A d + 1 , ,
B, k, .
n n
. , Ai Aj
:
, en:association scheme.
- . ,
, Ai A, .

- 1 v1.
C2d+1 - k = 2 d.
ai = 0, bi = 1, ci = 1, ( ) cd = 2.
, -en:Hoffman-Singleton graph,
.
.
.

[1] , A.M. Cohen, and A. Neumaier (1989), Distance Regular Graphs. Berlin, New York: Springer-Verlag. ISBN 3-540-50619-5, ISBN
0-387-50619-5

C. D. Godsil Algebraic combinatorics. NewYork: Chapman andHall, 1993. .xvi+362. (Chapman
andHall Mathematics Series). ISBN 0-412-04131-6
- 154
-
- ,
v w, i,
x y, ,
, v x w y.

,
.
- , , -
.

- , , -en:Biggs-Smith graph,
2. 3-
- .
1971 en:Norman L.
Biggs .. (D. H. Smith), , 12
- . :
K4 4 1 3 {3;1}
K3,3 6 2 4 {3,2;1,3}
10 2 5 {3,2;1,1}
8 3 4 {3,2,1;1,2,3}
14 3 6 {3,2,2;1,1,3}
18 4 6 {3,2,2,1;1,1,2,3}
en:Coxeter graph 28 4 7 {3,2,2,1;1,1,1,2}
30 4 8 {3,2,2,2;1,1,1,3}
20 5 5 {3,2,1,1,1;1,1,1,2,3}
20 5 6 {3,2,2,1,1;1,1,2,2,3}
en:Biggs-Smith graph 102 7 9 {3,2,2,2,1,1,1;1,1,1,1,1,1,3}
en: 90 8 10 {3,2,2,2,2,1,1,1;1,1,1,1,2,2,2,3}
1969 - ,
, -, -.
12- en:Tutte 12-cage, 126 .
- , -
en:Shrikhande graph. -
, -
.
en:Asymptotic analysis -
. .
.
- 155

G. M. Adel'son-Vel'skii, B. Ju. Vesfeler, A. A. Leman, I. A. FaradevAn example of a graph which has no
transitive group of automorphisms // . 1969. .185. .975976..
Norman Biggs Combinatorial Mathematics and its Applications (Proc. Conf., Oxford, 1969). London:
Academic Press, 1971. .1523..
Norman Biggs Finite Groups of Automorphisms. London & New York: Cambridge University Press, 1971.
.6. (London Mathematical Society Lecture Note Series)..
N. L. Biggs, D. H. SmithOn trivalent graphs // Bulletin of the London Mathematical Society. 1971. .2.
.3. .155158. DOI:10.1112/blms/3.2.155 [1].
D. H. SmithPrimitive and imprimitive graphs // The Quarterly Journal of Mathematics. Oxford. Second Series.
1971. .4. .22. .551557. DOI:10.1093/qmath/22.4.551 [2].

N. L. BiggsAlgebraic Graph Theory // 2nd. Cambridge University Press, 1993. .155163., 20
Distance-Transitive Graphs.
John Van BonFinite primitive distance-transitive graphs // European Journal of Combinatorics. 2007.
.2. .28. .517532. DOI:10.1016/j.ejc.2005.04.014 [3].
A. E. Brouwer, A. M. Cohen, A. NeumaierDistance-Regular Graphs. New York: Springer-Verlag, 1989.
.214234., 7 Distance-Transitive Graphs.
A. M. Cohen Cohen Topics in Algebraic Graph Theory / L. W. Beineke, R. J. Wilson. Cambridge University
Press, 2004. .102. .222249. (Encyclopedia of Mathematics and its Applications)..
C. Godsil, G. Royle Algebraic Graph Theory. New York: Springer-Verlag, 2001. .6669.,
Distance-Transitive Graphs, 4.5.
A. A. Ivanov The Algebraic Theory of Combinatorial Objects / I. A. Faradev, A. A. Ivanov, M. Klin, A. J.
Woldar. Dordrecht: Kluwer, 1992. .84. .283378. (Math. Appl. (Soviet Series))..

Weisstein, Eric W. Distance-Transitive Graph [4](.) Wolfram MathWorld.

[1] http:/ / dx. doi. org/ 10. 1112%2Fblms%2F3. 2. 155
[2] http:/ / dx. doi. org/ 10. 1093%2Fqmath%2F22. 4. 551
[3] http:/ / dx. doi. org/ 10. 1016%2Fj. ejc. 2005. 04. 014
[4] http:/ / mathworld. wolfram. com/ Distance-TransitiveGraph. html
( ) 156
( )

, :
( ),
. , .
,
.
,
, ,
[1].

(Reese T. Prosser) 1959 ,
10 (E. S. Lowry, C. W.
Medlock).
(Ron Cytron) 1989 , -,
SSA-.

SSA-.
.
, .
,
. ,
.

, , ,
, ,
.
: , ,
: , .
, , .
,
, ,
[2].
( ) 157

[1] : , , 2008, . 787
[2] : , , 2008, . 788

. , . , , . : ,
= Compilers: Principles, Techniques, and Tools. "", 2008. ISBN
0-321-48681-1

G
H,
, G,

, G.
,

, .
() ().

G=(V,E) K
V. H=(V,K\E) G.

:
( , ) , .
.
.
, .
en:Cograph ,
.
(, ) .
( ) 158
( )
, .
:
en:tree decomposition,
, en:haven (graph theory)
en:pursuit-evasion , ,
.
en:parameterized complexity .
k k-en:partial k-tree.
.
(Halin 1976) ,
en:Hadwiger number, .
(Robertson, Seymour 1984)
.[1]

en:tree decomposition G =
(V, E) T, X1, ..., Xn
V,
[2]
:
1. Xi V.
,
.
2. Xi Xj v,
Xk ()
Xi Xj n v .
, , v,
T.
3. (v, w) G
Xi, v, w. ,

T.

Xi .
tw(G) G ,
.
G.

,
.
. ,
.
, G
, G.
( ) 159
, G
, ( ) Xi.
, ,
en:pursuit-evasion . G k
, k + 1, .
k + 1 , X k
G G \ X
.
,
, (
, ,
).[3] , G
( ),
.
,
.

Kn n1.
33
, -,
, ,
. 3
, ,
1 , .
, ( , ).
, ,
, , .

k , k,
k-en:partial k-tree.
en:cactus graph, en:pseudoforest, -
en:series-parallel graph, en:outerplanar graph,
en:Apollonian network. ,
, ,
, .[4]
, n n
, n. , F -
, . ,
F, k,
F k. ,
:[5]
1. F - ;
( ) 160
2. F ;
3. F - , .

k
, k,

en:Forbidden graph
characterization,

.
k = 1
3
.
k = 2
K 4 4
.
k = 3
K5,
,
en:pentagonal prism
3
en:Wagner graph.
en:polyhedral graph .[6]
k k.[7]
.[8]

, G , k, NP-
.[9] , k , k
. k
.
, (Shoikhet, Geiger 1997) ,
100 11,
.

,

, ,[10] ,
. [11],
, NP- ,

.
( ) 161
, k
. Xi
Xi ,

.
n O(kk+O(1)n),
en:parameterized complexity.

en:pathwidth
, , .

. ,
, .
, en:graph bandwidth, ,
, . ,
en:tree-depth, , - ,
-, en:Degeneracy (graph theory), ,
.

nn n, G
-en:graph minor G. ,
f, , f(r), r
-. , f : f (r2logr)
202r5.[12] ,

en:bidimensionality.[13] en:Halin's grid theorem
.[14]

, F ,
en:upper bound .
en:graph minor F F, F
, en:Forbidden graph characterization F
en:apex graph.[15] ,
,
. [16] [13], , ,
.[17]
en:bidimensionality,[18] ,
, -
.[19]
, ,
. , 1- en:1-planar graph, ,
( ) 162
, ,
.
-
.[20]
S-
(Halin 1976) , S-,
. ,

en:graph minor,
, . ,
,
.
.
, en:Hadwiger number,
en:graph minor .

[1] .354355
[2] , 12.3
[3] Seymour, Thomas, 1993
[4] Thorup, 1998
[5] Robertson, Seymour, 1986
[6] ; .
[7] Ramachandramurthi, 1997
[8] Lagergren, 1993
[9] Arnborg, Corneil, Proskurowski, 1987
[10] Bertel, Brioschi, 1972
[11] ; ; .
[12] . O o .
[13] Demaine, Hajiaghayi, 2008
[14] Diestel, 2004
[15] Eppstein, 2000
[16] ; .
[17] Demaine, Hajiaghayi, 2004b
[18] ; .
[19] Frick, Grohe, 2001
[20] Grigoriev, Bodlaender, 2007

S. Arnborg, D. Corneil, A. ProskurowskiComplexity of finding embeddings in a k-tree // SIAM Journal on Matrix
Analysis and Applications. 1987. .2. .8. .277284. DOI: 10.1137/0608024 (http://dx.doi.
org/10.1137/0608024).
Stefan Arnborg, Andrzej Proskurowski, Derek G. CorneilForbidden minors characterization of partial 3-trees //
Discrete Mathematics. 1990. .1. .80. .119. DOI: 10.1016/0012-365X(90)90292-P (http://
dx.doi.org/10.1016/0012-365X(90)90292-P).
S. Arnborg, A. ProskurowskiLinear time algorithms for NP-hard problems restricted to partial k-trees // Discrete
Applied Mathematics. 1989. .1. .23. .1124. DOI: 10.1016/0166-218X(89)90031-0 (http://
dx.doi.org/10.1016/0166-218X(89)90031-0).
( ) 163
M. W. Bern, E. L. Lawler, A. L. WongLinear-time computation of optimal subgraphs of decomposable graphs //

Journal of Algorithms. 1987. .2. .8. .216235. DOI: 10.1016/0196-6774(87)90039-3 (http:/
/dx.doi.org/10.1016/0196-6774(87)90039-3).
Umberto Bertel, Francesco BrioschiNonserial Dynamic Programming. Academic Press, 1972. ISBN
0-12-093450-7..
Hans L. BodlaenderProc. 15th International Colloquium on Automata, Languages and Programming.
Springer-Verlag, 1988. .317. .105118. DOI: 10.1007/3-540-19488-6_110 (http://dx.doi.org/10.
1007/3-540-19488-6_110).
Hans L. BodlaenderA linear time algorithm for finding tree-decompositions of small treewidth // SIAM Journal
on Computing. 1996. .6. .25. .13051317. DOI: 10.1137/S0097539793251219 (http://dx.
doi.org/10.1137/S0097539793251219).
Hans L. BodlaenderA partial k-arboretum of graphs with bounded treewidth // Theoretical Computer Science.
1998. .12. .209. .145. DOI: 10.1016/S0304-3975(97)00228-4 (http://dx.doi.org/10.1016/
S0304-3975(97)00228-4).
Erik D. Demaine, Fedor V. Fomin, MohammadTaghi Hajiaghayi, Dimitrios M. ThilikosBidimensional
parameters and local treewidth // SIAM Journal on Discrete Mathematics. 2004. .3. .18.
.501511. DOI: 10.1137/S0895480103433410 (http://dx.doi.org/10.1137/S0895480103433410).
Erik D. Demaine, MohammadTaghi HajiaghayiDiameter and treewidth in minor-closed graph families, revisited
// Algorithmica. 2004a. .3. .40. .211215. DOI: 10.1007/s00453-004-1106-1 (http://dx.
doi.org/10.1007/s00453-004-1106-1).
Erik D. Demaine, MohammadTaghi HajiaghayiProceedings of the Fifteenth Annual ACM-SIAM Symposium on
Discrete Algorithms. New York: ACM, 2004b. .840849..
Erik D. Demaine, Mohammad Taghi HajiaghayiLinearity of grid minors in treewidth with applications through
bidimensionality // Combinatorica. 2008. .1. .28. .1936. DOI:
10.1007/s00493-008-2140-4 (http://dx.doi.org/10.1007/s00493-008-2140-4).
Reinhard DiestelA short proof of Halin's grid theorem // Abhandlungen aus dem Mathematischen Seminar der
Universitt Hamburg. 2004. .74. .237242. DOI: 10.1007/BF02941538 (http://dx.doi.org/10.
1007/BF02941538).
Reinhard DiestelGraph Theory // 3rd. Springer, 2005. ISBN 3-540-26182-6..
D. EppsteinDiameter and treewidth in minor-closed graph families // Algorithmica. 2000. .3-4.
.27. .275291. DOI: 10.1007/s004530010020 (http://dx.doi.org/10.1007/s004530010020).
Markus Frick, Martin GroheDeciding first-order properties of locally tree-decomposable structures // Journal of
the ACM. 2001. .6. .48. .11841206. DOI: 10.1145/504794.504798 (http://dx.doi.org/
10.1145/504794.504798).
Alexander Grigoriev, Hans L. BodlaenderAlgorithms for graphs embeddable with few crossings per edge //
Algorithmica. 2007. .1. .49. .111. DOI: 10.1007/s00453-007-0010-x (http://dx.doi.org/
10.1007/s00453-007-0010-x).
Rudolf HalinS-functions for graphs // Journal of Geometry. 1976. .8. .171186. DOI:
10.1007/BF01917434 (http://dx.doi.org/10.1007/BF01917434).
Jens LagergrenGraph structure theory (Seattle, WA, 1991). Providence, RI: American Mathematical Society,
1993. .147. .601621. DOI: 10.1090/conm/147/01202 (http://dx.doi.org/10.1090/conm/147/
01202).
Siddharthan RamachandramurthiThe structure and number of obstructions to treewidth // SIAM Journal on
dx.doi.org/10.1137/S0895480195280010).
Neil Robertson, Paul D. SeymourGraph minors III: Planar tree-width // Journal of Combinatorial Theory, Series
B. 1984. .1. .36. .4964. DOI: 10.1016/0095-8956(84)90013-3 (http://dx.doi.org/10.
( ) 164
1016/0095-8956(84)90013-3).
Neil Robertson, Paul D. SeymourGraph minors V: Excluding a planar graph // Journal of Combinatorial Theory,
Series B. 1986. .1. .41. .92114. DOI: 10.1016/0095-8956(86)90030-4 (http://dx.doi.org/
10.1016/0095-8956(86)90030-4).
Neil Robertson, Paul Seymour, Robin ThomasQuickly excluding a planar graph // Journal of Combinatorial
Theory. 1994. .2. .62. .323348. DOI: 10.1006/jctb.1994.1073 (http://dx.doi.org/10.
1006/jctb.1994.1073).
A. Satyanarayana, L. TungA characterization of partial 3-trees // Networks. 1990. .3. .20.
.299322. DOI: 10.1002/net.3230200304 (http://dx.doi.org/10.1002/net.3230200304).
Paul D. Seymour, Robin ThomasGraph Searching and a Min-Max Theorem for Tree-Width. // Journal of
Combinatorial Theory, Series B. 1993. .1. .58. .2233. DOI: 10.1006/jctb.1993.1027 (http:/
/dx.doi.org/10.1006/jctb.1993.1027).
Kirill Shoikhet, Dan GeigerProc. AAAI '97. 1997. .185190..
Mikkel ThorupAll structured programs have small tree width and good register allocation // Information and
Computation. 1998. .2. .142. .159181. DOI: 10.1006/inco.1997.2697 (http://dx.doi.org/
10.1006/inco.1997.2697).

,
.
.

, ,
. ,
. , ,
, ,
.

en:linear programming relaxation
. , 5:2- . A
4:2- .

.
165

b- G
b ,
.
a:b- b- , ,
, a .
b- b(G) a,
a:b-.
f(G)
: 3:1- 5 ,
6:2-.
: 5:2 .
, , b(G)
en:subadditive function, a+b(G) a(G)
+ b(G).
. f(G)
k, G
, v S

.
n(G) G, (G) , (G) , (G)
.

f(G) G .
(G) G (G,x) ,
x.
xI. f(G)
en:dual problem "

", . ,
G,
1. en:strong duality
. , , ,
G,
NP- .[1] ,
, .[2]
166

. G
G u v u v .
, , G.
G ,
() ( )
. x
, , I
. I I .
I .
. G .
G .
.
( ) .

, , ,
: ,
2, . , ,
.
, , .
/ ( )
.

[1] and : " On the hardness of approximating minimization problems (http:/ / dx. doi. org/ 10. 1145/ 185675. 306789)", J. ACM 41:5(1994), p.
960-981.
[2] Bruce Hajek and Galen Sasaki: " Link scheduling in polynomial time (http:/ / dx. doi. org/ 10. 1109/ 18. 21215)", IEEE Transactions on
Information Theory 34:5(1988), p. 910-917.

Edward R. Scheinerman, Daniel H. Ullman Fractional graph theory. New York: Wiley-Interscience, 1997.
ISBN 0-471-17864-0.
Chris Godsil, Gordon Royle Algebraic Graph Theory. New York: Springer-Verlag, 2001. ISBN
0-387-95241-1.
( ) 167
( )

G
G, :
, ,
,
.
, G,

.
G.[1]

en:haven (graph theory) k G
,
X k 33 ,

GX ,
(X) (Y) . ,
k G. ,
X , ,
(X), , X.
(Seymour, Thomas), (, , )
k ,
k 1.

(Grohe, Marx), ,
, ,
,
. , , ,
, . ,
k
.

,
. ,
, k,
, O(nk+2), n .
.
, .
, ,
.
( ) 168
k
, ,
(Grohe, Marx 2009) .

[1] . "" (screens), "".

(.Travelling salesman problem, TSP)
( )
,
,

.
(, ,
)
, . ,
,

.

,
15 .
(
, 43 589 145 600.
),
( ),
. ,
.
NP- ,
. decision problem ( ,
, k) NP- .
: (66 )
,
.

.
. , ,
. ?
. ,
, ( ,
).
, ,
.
? , ,
. ,
169
. , ,
.

, . ,
1832 ,
(.Der Handlungsreisende wie er
sein soll und was er zu tun hat, um Auftrge zu erhalten und eines glcklichen Erfolgs in seinen Geschften gewi zu
sein von einem alten Commis-Voyageur), ,
.
.
.Icosian Game 19 ,
, 20 .
(.Karl Menger),
1930 :
( , ,
) ,
.

(.Traveling Salesman Problem),
(.Hassler Whitney)
.

,
. ,
20- ,
,
.

, ,
, .
.
1950- 1960- .
, (.Delbert Ray Fulkerson)
(.Selmer M. Johnson), 1954 RAND Corporation
.
, 49
. 1960- 1970- ,
, , .
1972 NP- , ,
, NP- .
.
170
1970- 1980- , (.Martin

Grtschel), (.Manfred Padberg) (.Giovanni Rinaldi) ,
,
2393 .
1990- (.David Applegate), (.Robert Bixby),
(.Vaek Chvtal) (.William Cook) .
(.Gerhard Reinelt) TSPLIB

. 2005 33 810 :
66 048 945 . 2006
85 900 . ,
, 1% .

,
.
, , .
, ( .: A D)
,
.
( .: 20,
42, ), , ,
, . ( .
) ,
.
.
, ,
, , .
, ,
. - ,
.
, ,
, .

, ,
. , , .
,
, .
.
(. ).
171
, ,
.

,
. , , ,
:
,
.

:
,
( ) ,
,
,
.
, , ,

. ,
, ,
,
.
- , ,
.
.
,
. .
, , .

. ,

.

,
, .
, . ,
. , 1,
, 0 .
, .
, ,
.
172

, , :
1 (
) 0 ( ). ,
,
. 2, :
.
.
,
.
, .

, ,
,
(. ). ,
(
), ,
1954
(.loop conditions). :
, .
,
, ,
:
, .
. ,
.
, .
(2) , ,
, ,
. ,
.
1960 ,
, ,
. , - ,
NP-.
, , 0 1, ,
, :
0 1, ,
.
173
(2) ,
.
, ,
. ,
. ,
, ( ),
, . ,
, (1) (2) () ,
. ,
. , ,
. (1) (2)
, ,
(. ).

,
,
. ,
.
(, ) NP-.
, P NP,
,
.
, ,
,
.
,
.
, , 1,5 .
, () , ,
. ,
(PTAS).

,
. ,
.
, ,
0.
.
, ,
(,
, , 1).
(, 0 ,
0). , ,
174
:

.

( )
. ,
. any-time ,
.
, NP-.
: G ,
x.
.
:
, .

,
.
. ,
, , 15 43
18 177 . ,
, . ,
30 , ; ,
40 .
175
, ,

.
,
,
- ,
.
, 0/1,
. , :
,
, .

.
. ,
. (1, 1, 1).
, ,
. ,
, . ,
(1,1,1),
. , , ,
, , - (0, 0, 0), (1, 0, 0), (0, 1, 0)
(0, 0, 1). ,
(1, 1, 1).
(1).

,
.
.
, , .
, ,
. , 100, 102,
100 102.
,
(102100)/100 = 2%, 102
2% . ,
, .
.
1963 (.
, . , . , .).[1]
176

1987 (Durbin) (Willshaw),
[2].
(
).
, .

. ,
, .. .
:
, .
.

. 3. : // :
= Introduction to The Design and Analysis of Algorithms. .: , 2006.
.159-160. ISBN 0-201-74395-7
. , . , . , :
= Introduction to Algorithms. 2- . .: , 2006. .1296. ISBN 0-07-013151-1
.. . .: , 1969. .62.

[1] .. : . : . / ...
.: , 2003. ., . 150, ISBN 985-6516-83-8
[2] (http:/ / www. intuit. ru/ department/ expert/ neurocomputing/ 6/ neurocomputing_6. html)

Java (http://sites.google.com/site/indy256/algo/dynamic_tsp)
177

NP- .
NP- .

,
,
S.
(size)
.
: , ,
4.

,
,
.

.
: .
: - .
, :
: .
: ?
.
,
.
, ,
. .
NP-
NP-, , ,
. ,
,
.

A compendium of NP optimization problems [1]
Challenging Benchmarks for Maximum Clique, Maximum Independent Set, Minimum Vertex Cover and Vertex
Coloring [2]
178

. . 36. NP- // : = INTRODUCTION TO
ALGORITHMS. 1- . .: ,
2001. .866.

[1] http:/ / www. nada. kth. se/ ~viggo/ wwwcompendium/ node10. html
[2] http:/ / www. nlsde. buaa. edu. cn/ ~kexu/ benchmarks/ graph-benchmarks. htm

NP- .
1972 .

,

. ,
.

.
: (.)
,
G k,

G
.
3.
NP-
NP- NP- ().
, k
k . ,
, .
NP- : .

NP- ,
. k ,
, , v
: n m n+m,
1 . ,
. , ,
179
.
, , ,
,
.

Cook, Stephen A. (1971). " The Complexity of Theorem-Proving Procedures (http://www.cs.toronto.edu/
~sacook/homepage/1971.pdf.gz)". Proceedings of the Third Annual ACM Symposium on Theory of Computing:
151-158. 2007-06-11.
Garey, Michael R. & Johnson, David S. (1979), Computers and Intractability: A Guide to the Theory of
NP-Completeness, W.H. Freeman, ISBN 0-7167-1045-5 A1.2: GT19, pg.194.

Coloring (http://www.nlsde.buaa.edu.cn/~kexu/benchmarks/graph-benchmarks.htm)

NP- .
.

,
.
,
. ,

. (.) (
) : G
k?
,
, :
G .
, 9
(G).

( ) . ( )
, ,
() . ,
, , .
. ,

180
. (-)
, ,
NP- .
.
en:dominating set. 3n/3
, .
n ,
n . ,
1.324718, .

, ,
.
, .
, .
(G) (G) .
G .
, , (G),
G (G).
, ,
( ).

en:computational problems,
.
,
. ,
.
, ,
, .
, .
,
.
,
, .
k, /:
, k .
, NP-
, .
G
G . ,
. , , ,
:
181
NP-, ,
.
NP- , , .

" ".

, .
NP-, . ,
, O(n22n), ,
, .
O(20.276n) .
( ), O*(1.2127n) .[1]

, ,
. , (,
, ),
. ,
, ,
MAXSNP-en:SNP (complexity), ,
c ( ) NP- ,
c . ,
, . ,
.
(+2)/3 .
, (
), [2]
NP- ,
c<1 .

en:Minor (graph theory) .
, ,
( ).
.

. O(3n/3).

182
API
[2] GPL C, Python, R,

igraph
Ruby
NetworkX BSD Python [3]

, . maximum_independent_set
OpenOpt BSD Python , , /

[4]
. . STAB

,
.

:
. ,
. .
, u ,
1, ( u);
,
. ,
:
grandchild , child .

, u :
function get_independent_set(Node u)
{
I(u) , I(u)
// , , u
children_sum = 0
// , , u
grandchildren_sum = 0
//
for i := 1 to child_num do
children_sum = children_sum + get_independent_set(children[i])
//
for i:= 1 to grandchildren_num
grandchildren_sum = grandchildren_sum + get_independent_set(grandchildren[i])
//,
I(u) = max(1 + grandchildren_sum, children_sum)
I(u)
}
183
get_independent_set(r) . , , O(|V| + |E|).

Godsil Chris Algebraic Graph Theory. New York: Springer, 2004. ISBN 0-387-95220-9
Richard Karp (1972). Reducibility Among Combinatorial Problems. Proceedings of a Symposium on the
Complexity of Computer Computations.
Michael R. Garey, David S. Johnson Computers and Intractability: A Guide to the Theory of
NP-Completeness. W.H. Freeman, 1979. ISBN ISBN 0-7167-1045-5 A1.2: GT20, pg.194.
Moon, J. W. & Moser, L. (1965), "On cliques in graphs", Israel J. Math. .3: 2328, MR0182577 [5]
Sanjoy Dasgupta , Christos H. Papadimitriou, Umesh Vazirani Algorithms [6]. 1- . McGraw-Hill
Science/Engineering/Math, 2006. .336. ISBN 0073523402
Najiba SbihiAlgorithme de recherche d'un stable de cardinalit maximum dans un graphe sans toile (French) //
Discrete Mathematics. 1980. .1. .29. .5376. DOI:10.1016/0012-365X(90)90287-R [7].
M. Grtschel, L. Lovsz, A. Schrijver Geometric Algorithms and Combinatorial Optimization.
SpringerVerlag, 1988. .2. .296298. ISBN 0-387-13624-X.

[1] *.
[2] . .
[3] http:/ / networkx. lanl. gov/ reference/ generated/ networkx. algorithms. approximation. independent_set. maximum_independent_set. html
[4] http:/ / openopt. org/ STAB
[5] http:/ / www. ams. org/ mathscinet-getitem?mr=0182577
[6] http:/ / www. cs. berkeley. edu/ ~vazirani/ algorithms. html
[7] http:/ / dx. doi. org/ 10. 1016%2F0012-365X%2890%2990287-R
Weisstein, Eric W. Maximal Independent Vertex Set (http://mathworld.wolfram.com/

MaximalIndependentVertexSet.html)(.) Wolfram MathWorld.
Coloring (http://www.nlsde.buaa.edu.cn/~kexu/benchmarks/graph-benchmarks.htm)
., . (http://rain.ifmo.ru/cat/view.
php/theory/unsorted/approx-2004)
(http://logic.pdmi.ras.ru/~kulikov/simplealgscourse/
lecture7-slides.pdf)
184

,
.
(17961863).

(16011665), ,
, :
Qui hanc methodum non probaverit, ei proponitur: Datis tribus
punctis, quartum reperire, a quo si ducantur tres rectae ad data puncta, A, B
summa trium harum rectarum sit minima quantitas. C, S ABC.
, ,
[ ]: ,
, .
. (16081647) . (15981647), .
(15771644), . (17101761)
. . (18221900). ,
S, ( ),
A, B C AS, BS, CS.
1934 . O. ,
. ,
, .
1941 . . ?,
:

. , ,
, .
:
, (
) . , ,
. ,
.
, - .
, .
, ,
.
185

.
.

X, , .
,
.
, , ,
, . , ,
, .
.
, . ,
, , ,
.

,
, ,
(. ).
,
, ,
. , -
( 2-; 2-).
( ),
, ,
, , :
(, , ..) (,
, ..), (,
).
,
, ,
, , .
,
, ,
.

,
1 2. . ,
,
, ,
.
.
, .
186
. ,
,
.
, , ,
. , ,
, .
, , ,
, . ,
, . ,
.

.. ...
.
, , .
(, ,
), , ,
,
. , ,
, .
,
, . ,
, , ,
, .
.

. . , . . . :
, 2003. ISBN 5-93972-292-X
. . , . . (http://mi.
mathnet.ru/msb1416) // . .. 1991. .182. 12. .18131844.
Weisstein, Eric W. Steiner Tree (http://mathworld.wolfram.com/SteinerTree.html)(.) Wolfram
MathWorld.
187

,
n2. , (n)
n(n 1)/2,
n2/2.
Ethernet.
,
.
. ,
1 , 10 45
, 100 - 4950 , , - .
External links
[1]. .

[1] http:/ / kolonitsky. org/ blog/ 2012/ 03/ metcalfe-low/
-
- ( )
, , .
- ,
.
, - () ,
, (zig) , (zag) ,
.
- , (Reingold, Vadhan, Wigderson,
2000) . - ,
. -
SL L .

- c - c
.
- - ,
:
:
1. .
2. .
3. .
4. .
- 188

- ,
- . , , -
.
, -
, .

.
- . ,
( ), -
.
: - ,
.
,
, .

- .
. : - - .
, ,
, ( , ,
).

2002- , (Omer Reingold, Salil Vadhan, Avi Wigderson)
.
.
- , ,
.
.
- 189
s-t

2005- st-,
. ,
. -.
, s-t
-
.
( ) , -
.

Omer Reingold, Luca Trevisan, Salil VadhanProc. 38th ACM Symposium on Theory of Computing (STOC).
2006. .457466. DOI: 10.1145/1132516.1132583 (http://dx.doi.org/10.1145/1132516.1132583).

( )
, .
,
. (
). , , ()
().
.
.
.

190
,
, .

[1].
( ),
.
.
,
()
( )
.
(.sorting
strategies) [2]:
1. (.single linkage). , .
2. (.complete linkage). , .
3. (.pair-group method using arithmetic averages).
(.unweighted).
(.weighted).
4. (.pair-group method using the centroid average).
.
().
5. (.Wards method).
, .. [3]:
() ; (),
; ; .
[4]
.
[5].
.

, [6].
,
. ,
, .
.
191

.
[7][8][9][10].
,
(),
[11],

[12].
.

( ).

( ) 1909 [13].
:
,
,
, ,
. , , ,
[14]
.
[15].

:
,
, -
- () ,
; ()
. ,
( ):

, n .
, .
- ( ),
. ,
. .
192

[1] . - . .: , 1988. 345 .
[2] . . . . .: , 1980. 390 .
[3] . ., . ., . ., . . : .
.: , 1989. 607 .
[4] Lance G.N., Willams W.T. A general theory of classification sorting strategies. 1. Hierarchical systems // Comp. J. 1967. 9. P. 373380.
[5] Sneath P.H.A., Sokal R.R. Numerical taxonomy: The principles and practices of numerical classification. San-Francisco: Freeman,
1973. 573 p.
[6] Ward J.H. Hierarchical grouping to optimize an objective function // J. of the American Statistical Association, 1963. 236 .
[7] von Terentjev P.V. Biometrische Untersuchungen ber die morphologischen Merkmale von Rana ridibunda Pall. (Amphibia, Salientia) (http:/
/ biocomparison. ucoz. ru/ _ld/ 0/ 91_terentjev_1931. pdf) // Biometrika. 1931. 23(1-2). P. 23-51.
[8] . . // . . 9. 1959. . 35-43.
[9] . . // . . 1. .:
1960. . 42-58.
[10] . . // . .:
. 3. 1964. . 19-22.
[11] . . .: , 1981. 160 .
[12] Florek K., Lukaszewicz S., Percal S., Steinhaus H., Zubrzycki S. Taksonomia Wroclawska // Przegl. antropol. 1951. T. 17. S. 193211.
[13] Czekanowski J. Zur differential Diagnose der Neandertalgruppe // Korrespbl. Dtsch. Ges. Anthropol. 1909. Bd 40. S. 44-47.
[14] . . . .: , 1969. 232 .
[15] Tamura S., Hiquchi S., Tanaka K. Pattern classification based on fuzzy relation (http:/ / biocomparison. ucoz. ru/ _ld/ 0/ 90_tamura_1971.
pdf) // IEEE transaction on systems, man, and cybernetics, 1971, SMC 1, 1, P. 61-67.

,
, .
. ,
,
. ,
.
,
.
, ,
. ,
, (.),
A000088 OEIS (1, 1, 2, 4, 11, 34, 156, 1044, 12346, ...).
, ( ),
.
193

, , .

,
.
( ,
, ,
), .
- (
), .

[1],
1932 , ,
, ,
( 3 )
, , :
()
.
() ,
.

, ,
( ,
). / G,
,
( ),
.
.
,
. , (- -
) .
.
, , , , .
60- 80- XX , .
194

, . . (.),
, .
, , , .

NP,
NP- P ( , P NP).
(.) NP-.
, .

,
() , (
), ( ).

[1] (. 3, .: , 2006. 296 .)

(-),
.
, .

:
()
.
.
.
- - ,

. - ,
; - .
, .
, .
, .
195
, .

( ). ,
.
.
.
.

-
, .
k- ,
: .

( ). ,
.
/ .
.
.
.
.
, ()
, , ,
.
:
i;
i- ;
i- (i-);
i-;
,
i ;
i- ( i ).
196
, ,
:
, ,
;
, i- ,
(, ) ;
, i- ,
( );
(.).
,

,
. ,
.

. , ,
, , , , , ,
.
,
.
, , ,
, . 60- 80-
XX , .

( )
. :
( -, - ),

. (
) [1].

[1] .., .., . , 2005, 21662176.
197

.

,
.

.
.
,
.
. , G
, G
, , ,
.[1]

,
G.
(Booth, Lueker 1976)
PQ-, , , (Habib, McConnell,
Paul, Viennot 2000) ,
en:lexicographic breadth-first search ,
, [1][2].

, , [1][2].
en:comparability graph[3],
en:interval order[1].
, ,
, , en:trivially perfect graph.
, ,
.
, ,
. .
, [4].
, ,
198
, [5].
, ,
. , ,
, .
en:pathwidth (,
, ), a G
, G [6].
-en:caterpillar tree[7].

RAND, ,
en:Peter C. Fishburn , en:Joel E. Cohen,
, en:D. R. Fulkerson ( ) en:Victor Klee[8].
, [9].
, , . ,
,
[10].
en:resource allocation .
.

, [11].

[1] Fishburn, 1985
[2] Golumbic, 1980
[3] Gilmore, Hoffman, 1964
[4] , p. 89.
[5] Roberts, 1969
[6] Bodlaender, 1998
[7] Eckhoff, 1993
[8] ix-10 (http:/ / books. google. se/ books/ princeton?hl=en& q=interval+ graph& vid=ISBN9780691082028& redir_esc=y#v=snippet&
q="interval graph"& f=false)
[9] 12-33 (http:/ / books. google. se/ books/ princeton?hl=en& q=interval+ graph& vid=ISBN9780691082028& redir_esc=y#v=snippet&
q="interval graph"& f=false)
[10] Zhang ., 1994
[11] Bar-Noy, Bar-Yehuda, Freund, Naor, 2001

Amotz Bar-Noy, Reuven Bar-Yehuda, Ari Freund, Joseph (Seffi) Naor, Baruch SchieberA unified approach to
approximating resource allocation and scheduling // Journal of the ACM. 2001. .5. .48.
.10691090. DOI: 10.1145/502102.502107 (http://dx.doi.org/10.1145/502102.502107).
Hans L. BodlaenderA partial k-arboretum of graphs with bounded treewidth // Theoretical Computer Science.
S0304-3975(97)00228-4).
K. S. Booth, G. S. LuekerTesting for the consecutive ones property, interval graphs, and graph planarity using
PQ-tree algorithms // J. Comput. System Sci.. 1976. .3. .13. .335379. DOI:
199
10.1016/S0022-0000(76)80045-1 (http://dx.doi.org/10.1016/S0022-0000(76)80045-1).
Joel E. Cohen Food webs and niche space. Princeton, NJ: Princeton University Press (http://press.princeton.
edu/titles/324.html), 1978. Vol.11. P.xv+1190. ISBN 978-0-691-08202-8
EckhoffExtremal interval graphs // Journal of Graph Theory. 1993. .1. .17. .117127. DOI:
Ralph Faudree, Evelyne Flandrin, Zdenk RyjekClaw-free graphs A survey // Discrete Mathematics.
1997. .13. .164. .87147. DOI: 10.1016/S0012-365X(96)00045-3 (http://dx.doi.org/10.
1016/S0012-365X(96)00045-3).
Peter C. Fishburn Interval orders and interval graphs: A study of partially ordered sets. New York, 1985.
(Wiley-Interscience Series in Discrete Mathematics).
D. R. Fulkerson, O. A. GrossIncidence matrices and interval graphs // Pacific Journal of Mathematics.
1965. .15. .835855..
P. C. Gilmore, A. J. HoffmanA characterization of comparability graphs and of interval graphs // Can. J.
Math.. 1964. .16. .539548. DOI: 10.4153/CJM-1964-055-5 (http://dx.doi.org/10.4153/
CJM-1964-055-5).
Martin Charles GolumbicAlgorithmic Graph Theory and Perfect Graphs. Academic Press, 1980. ISBN
0-12-289260-7..
Martin Charles Golumbic, Ron ShamirComplexity and algorithms for reasoning about time: a graph-theoretic
approach // J. Assoc. Comput. Mach.. 1993. .40. .11081133..
Michel Habib, Ross McConnell, Christophe Paul, Laurent ViennotLex-BFS and partition refinement, with
applications to transitive orientation, interval graph recognition, and consecutive ones testing // Theor. Comput.
Sci.. 2000. .234. .5984. DOI: 10.1016/S0304-3975(97)00241-7 (http://dx.doi.org/10.1016/
S0304-3975(97)00241-7).
F.S. Roberts Proof Techniques in Graph Theory. Academic Press, New York, 1969. .139146..
Peisen Zhang, Eric A. Schon, Stuart G. Fischer, Eftihia Cayanis, Janie Weiss, Susan Kistler, Philip E. BourneAn
algorithm based on graph theory for the assembly of contigs in physical mapping of DNA // Bioinformatics.
1994. .3. .10. .309317. DOI: 10.1093/bioinformatics/10.3.309 (http://dx.doi.org/10.1093/
bioinformatics/10.3.309).

interval graph (http://www.graphclasses.org/classes/gc_234.html). Information System on Graph Classes and
their Inclusions (http://www.graphclasses.org/index.html).
Weisstein, Eric W. {{{title}}} (http://mathworld.wolfram.com/IntervalGraph.html)(.) Wolfram
MathWorld.
( ) 200
( )
n- n
. ,
3 .
.
2 < n < 9 n-,
(
). ,
,
(.).
3- 4, , 4 .
4- 3,3,

, 6 .
5- , 10 .
2.
6- , 14 . 1-
( , ),
.
3.
7- , 24 .
8.
8- , 30 .

(r,n)- r (

r ) n
.

(2,n)- , , Cn
(r-1,3)- r r
(2r,4)- r,r,
r

(7,5)- -, 50 .
.
(r,n)- 3r7
3n12. r n : [1] (
).
( ) 201
n: 3 4 5 6 7 8 9 10 11 12
r = 3: 4 6 10 14 24 30 58 70 112 126
r = 4: 5 8 19 26 67 80 275 384 728
r = 5: 6 10 30 42 152 170 2730
r = 6: 7 12 40 62 294 312 7812
r = 7: 8 14 50 90

(r,n)-
, .
r > 2 n > 2, .
, , , -.
,[2][3][4] n = 5, r = 2, 3, 7 , , 57, n = 6, 8,
12.
( ) 202

[1] http:/ / people. csse. uwa. edu. au/ gordon/ cages/ allcages. html
[2] Bannai, E. and Ito, T. On Moore Graphs. J. Fac. Sci. Univ. Tokyo Ser. A 20, 191208, 1973
[3] Damerell, R. M. On Moore Graphs. Proc. Cambridge Philos. Soc. 74, 227236, 1973
[4] Hoffman, A. J. and Singleton, R. R. On Moore Graphs of Diameter 2 and 3. IBM J. Res. Develop. 4, 497504, 1960

. . .: , 2003. 300 ISBN 5-354-00301-6.

Weisstein, Eric W. (http://mathworld.wolfram.com/CageGraph.html)(.)
Wolfram MathWorld.
http://people.csse.uwa.edu.au/gordon/cages/ (.)
( )

, ,

.

.
,

( )
NP-.

.
23 , 1 ( ), 42 ,
2 ( ), 19 , 3
( ), , 4
(- ).

11 -
(Erds, Szekeres, .
1935),[1] "" - 4- , ,
(Luce, Perry, 1949), 4.

, , .
, , , .
( ) 203

G=(V,E) CV,
C . , ,
C .
,
, , .
. (G) G
- G. en:Intersection number (graph theory)
G , G.
,
. en:clique cover
, .
, . en:bipartite dimension
, .

.
.
, . ,
.
,
.
(Moon, Moser, 1965) , 3n
3n . , K3,3,...,
en:Turn graph,
.
, , (
en:Hadwiger number) .
--en:ErdsFaberLovsz conjecture
.
:
,
, , en:neighborhood (graph theory) v
v.
en:cograph , ,
.
, , ,
v, , v .
,
.
,
.
,
.
, .
( ) 204
, . ,
en:clique complex G en:abstract
simplicial complex X(G) G
-en:simplex graph (G)
G , , .
en:median algebra
m(A,B,C) A, B, and C , A, B C.
en:clique-sum .
en:Clique-width
,
.
.
en:Intersection number (graph theory) ,
.

en:graph minor. , en:Kuratowski's theorem en:Wagner's
theorem
, .

. NP-, 21 NP- [2].
en:Parameterized complexity, en:Hardness of
approximation. ,
( ),
, ,
.

API
NetworkX BSD Python , max_clique
maxClique CRAPL Java , DIMACS
OpenOpt BSD Python , ,

( ) 205

"" ,
( , ) .
(Alba,
1973) , (Peay, 1974) (Doreian, Woodard, 1994).
. , -,
(Ben-Dor, Shamir, Yakhini, 1999)
, ,
. , (Tanay, Sharan, Shamir)
en:biclustering ,
. (Sugihara,1984)
en: . (Day, Sankoff, 1986)
, ,
, en:perfect phylogeny,
. (Samudrala, Moult, 1998)
,
, -en:protein-protein interaction,
(Spirin, Mirny, 2003) ,
. en:Power graph analysis
.
(Prihar, 1956) ,
(Paull, Unger, 1959)
.
en:automatic test pattern generation
. (Cong, Smith, 1993)
.
(Rhodes, Willett, Calvet, Dunbar, Humblet, 2003)
en:chemical database, .
, (Kuhl, Crippen, Friesen, 1983) ,
.

[1] .
, .
[2] *.

Kazimierz KuratowskiSur le problme des courbes gauches en Topologie (French) // Fundamenta
Mathematicae. 1930. .15. .271283..

Weisstein, Eric W. Clique (http://mathworld.wolfram.com/Clique.html)(.) Wolfram MathWorld.
Weisstein, Eric W. Clique Number (http://mathworld.wolfram.com/CliqueNumber.html)(.)
Wolfram MathWorld.
206

,
.

.
. ,
. ( ).
, , (
; ),
,
. .
,
1-2, 1-3, 1-4, 1-5 , 2-3, 2-4 ( ),
- , ( ,
, ) , .

. .
( ) 207
( )
-
2(n 1)
2 n>4
1 n=4
3 n, 4 n
Wn
Wn n (n 4),
(n-1)-.
n , Wn Wn+1
. 1-en:n-skeleton (n-1)-
.

{1,2,3,,v}. -
en:set-builder notation {{1,2},{1,3},,{1,v},{2,3},{3,4},,{v-1,v},{v,2}}.

, .
.
. , K4 = W4, W5,
W6.
Wn (
A002061 OEIS).
( ) 208
7 W4.
n Wn 3
, . n Wn
4 ( n 6) . W7 ,
.
Wn
,
-. k- en:graphic matroid Wk+1,
k- k- ()
, .
W6 ,
.
(Faudree, McKay, 1993) , W6 17,
K4 18. , G
17 G, W6 , ,
17 , K4.

209

(.complex networks) ()
.
, ,
, .
(. ()), ,
, , .
(. ), ,
,
.
- , .
.
, , , , , .
,
.

(node) (links).
. (directed network).
,
(undirected network). , ,
. . ,
. , ,
. , ,
.
(Degree distribution of nodes)

(degree) .
(out degree in degree).
.
2 3.

, , ,
. ,
, .
, .
210

, . ,
, - , .
. ,
, ,
.
. , .
, .
, .
(Assortativity Coefficient)
, , (),
, .
. . :
, .
. ,
. ,
. , .
.
. .

-
211

,
,

.

.
( ).

[1]

[1] http:/ / compscicenter. ru/ program/ lecture/ 6227|
212

( ) ,
, , ,
.
, , ()
, ( )
.
,
.
: ,
(, Maple Mathematica) ..

:
; ,
(, ..);
( ) ..
,
, ,
- .
.

( ). -
, , ,
, ,
. ,
.
.
.
,
, , , ,
, , .
, ,
- ,
, - .

. :
. ,
, , Journal of
Mathematical Chemistry. , ,
213
, ,
, , , ,
. ,
,
. ,
,
.
,
,
, ,
, .
, (),
, ,
, .
, .

(, , ..),
. ,
, (),
, .
. ,

, , ,
, ,
.

[1] = Chemical Applications of Topology and Graph
Theory / . . . .: , 1987. 560.
: = Artificial Intelligence Applications in Chemistry / .
., . . .: , 1988. 430. ISBN 5-03-001213-3
. . . . : ,
1980. 160.
Combinatorial Chemistry and Technology [2] / Miertus S., Fassina G.. Marcel Dekker, 1999. P.435.
ISBN 0-8247-1960-3
Discrete mathematical chemistry. (Editors: Pierre Hansen, P. W. Fowler, Maolin Zheng) AMS Bookstore, 2000.
392p. ISBN 0-8218-0987-3, 9780821809877 [3]
D. Bonchev, D. H. Rouvray (Eds.) Chemical Graph Theory. Introduction and Fundamentals. Abacus Press, New
York, 1991. ISBN 0-85626-454-7 [4]
. ., . .
[5] // . . ., 2005.
9. .2166-2176.
., . . : . , 2012. 384 . [6]
214

[1] http:/ / files. rushim. ru/ books/ obzor/ himicheskie-prilozhenia-grafov. djvu
[2] http:/ / files. rushim. ru/ books/ obzor/ combinatorial-chemistry-and-technology. djvu
[3] http:/ / books. google. ru/ books?id=wBUW9Dr8V_MC& dq=Mathematical+ Chemistry& printsec=frontcover& source=bl&
ots=dptKPEbpC8& sig=f0fzyZDjwAJNn_XAaT5BexC-aPc& hl=ru& ei=TZi4SYqcGMzD_gbO76mfBg& sa=X& oi=book_result&
resnum=6& ct=result
[4] http:/ / books. google. ru/ books?id=X0AG7HhiccoC& dq=Danail+ Bonchev+ (1991)+ %22Chemical+ Graph+ Theory:+ Introduction+ and+
Fundamentals%22+ ISBN+ 0856264547& printsec=frontcover& source=bn& hl=ru& ei=wEa7SbCcK5WGsAapkrToDg& sa=X&
oi=book_result& resnum=4& ct=result
[5] http:/ / www. russchembull. ru/ rus/ index. php3?id=37& idi=759& state=& rc=0& idp=0& action=showfull& type=
[6] http:/ / www. rcd. ru/ details/ 1432
( )
( )
, , " " .
" " , ,
, , (
, 3- [1]).
en:Jeff Cheeger.

.
, ,
[2]
:
(, , - , .)
( )
, . ,
, , " ", ,
"" "" () . "",
""
.
( ) 215
:
,
, (
, ) |V(G)| (
) .
, N 3 , ,
GN. 1, 2, ..., N
. ,

A , :
, ,
h(GN), N
. , , ,
" " N, .
, .
.

-,
.
.

( )

( )
( )
( )
( ) 216

[1] Lackenby, 2010
[2] Lubotzky, 2011

Donetti, L., Neri, F., and Muoz, M.Optimal network topologies: expanders, cages, Ramanujan graphs, entangled
networks and all that // J. Stat. Mech.. 2006. .08. .2006. DOI:
10.1088/1742-5468/2006/08/P08007 (http://dx.doi.org/10.1088/1742-5468/2006/08/P08007)
Lackenby, M.Heegaard splittings, the virtually Haken conjecture and property () // Invent. Math.. 2006.
.2. .164. .317359. DOI: 10.1007/s00222-005-0480-x (http://dx.doi.org/10.1007/
s00222-005-0480-x)
Mark LackenbyFinite covering spaces of 3-manifolds // Proceedings of the International Congress of
Mathematicians. Hyderabad, India. 2010.
Alexander LubotzkyExpander Graphs in Pure and Applied Mathematics // This paper is based on notes prepared
for the Colloquium Lectures at the Joint Annual Meeting of the American Mathematical Society (AMS) and the
Mathematical Association of America (MAA).. 2011.

v, k = (v
1)/2, = (v 5)/4, = (v 1)/4. , ,
, v 1 4 .
, v, ,
, v = 5, 9, 13, 17, 25, 29, ( ) , 1
4. v, ,
, .
,
. , k ,
(v 1)/2.

Brouwer, A.E., Cohen, A.M., and Neumaier, A. (1989), Distance Regular Graphs. Berlin, New York:
Springer-Verlag. ISBN 3-540-50619-5, ISBN 0-387-50619-5
217

en:Configuration (geomenty)
,
, .

,
.

:
,
.

, ABC abc
, Aa, Bb Cc
(
). ,
,
X = ABab, Y
= ACac Z = BCbc ,
. ,

,
, .
,
( ,
, ,
) .

,
, ,

[1]. , ,
, .
218
[1].

( ) ,
, .
, .
.
, ,
. ,
. [1].

,
, ,
.
120. , 120
, .

, 120
[1].
, ,
,
[2].

,
, .
.
(Kempe 1886) ,
, , ,

.

, ,

.
,
, 12 , en:Julius Petersen
,
. (Kempe 1886)
219

,
(103103), , 10
, 10
.

[3]. ,
20 ,
,
,
-.
(103103) ( ,
(103103),
,

),
, .
,
.
. , , .
. ,
.

[1] Barnes, 2012
[2] Coxeter, 1964
[3] Hilbert, Cohn-Vossen, 1952
Barnes John Gems of Geometry. Springer, 2012. .9597. ISBN 9783642309649

H.S.M Coxeter Projective Geometry. New York: Blaisdell, 1964. .2627.
David Hilbert; Stephan Cohn-Vossen Geometry and the Imagination. 2nd. Chelsea, 1952.
.119128. ISBN 0-8284-1087-9
A. B. KempeA memoir on the theory of mathematical form // Philosophical Transactions of the Royal Society of
London. 1886. .177. .170. DOI: 10.1098/rstl.1886.0002 (http://dx.doi.org/10.1098/rstl.
1886.0002)
External links
Weisstein, Eric W. Desargues Configuration (http://mathworld.wolfram.com/DesarguesConfiguration.
html)(.) Wolfram MathWorld.
220

, ,
. .
1, 2, ... 1, 2, 6, 20, 90, 544, ... ( A000666 OEIS)
en:rooted product of graphs.

, ( ).
:
1.
2. ( )
, ;

. :
1. 0;
2. , ,
.
.
- , .
: ,
(!) , .
.
, ,
.

C. D. Godsil, B. D. McKayA new graph product and its spectrum // Bull. Austral. Math. Soc.. 1978.
.1. .18. .2128. DOI: 10.1017/S0004972700007760 (http://dx.doi.org/10.1017/
S0004972700007760).
Frank HararyThe number of linear, directed, rooted, and connected graphs // Transactions of the American
Mathematical Society. 1955. .78. .445463. DOI: 10.1090/S0002-9947-1955-0068198-2 (http://
dx.doi.org/10.1090/S0002-9947-1955-0068198-2).

Weisstein, Eric W. Rooted Graph (http://mathworld.wolfram.com/RootedGraph.html)(.)
Wolfram MathWorld.
( ) 221
( )
2n

ui vi
ui vj ij.

, , = 2 n = n (n -
, 1) = =

, = = =
en:Kneser graph Hn,1,

1 - =
(n1)
n ,
.

, .
en:Schlfli double six, 12 30 ,
12 .
( ) 222

n(n1).
en:Complete coloring n
en:Complete coloring {ui, vi}
.
- .
(Archdeacon, Debowsky, Dinitz, Gavlas, 2004)
.
2n
,
.
. ,
,
,
n2. ,

.
,
( en:bipartite dimension,
)

.
2n K2 Kn,
2n.

, ,
. ,
n , .
, , [1] ,
en:mnage problem. 6, 8, 10, ...
()
2, 12, 312, 9600, 416880, 23879520, 1749363840, ... A094047 OEIS
, , en:greedy coloring
u0, v0, u1, v1, ..,
n , .
(Johnson, 1974) ,
Jn. (Frer, 1995) ,
.
(Matouek, 1996) ,
.
( ) 223
(Miklavi, Poronik, 2003) ,

, - .
(Agarwal, Alon, Aronov, Suri, 1994)) ,
en:visibility graph. , ,
.
2n , ,
en:order
dimensionn.

[1] ,
2n .
External links
Weisstein, Eric W. Crown Graph (http://mathworld.wolfram.com/CrownGraph.html)(.) Wolfram
MathWorld.

.
-
.

.
, , , , ,
. , ,
.
excel Crystal Ball 7.
224

,
. , 3-.
.
.

1932 en:R. M. Foster
,
en:Foster census.
, ,
, , , .
, , , ,
en:Nauru graph, en:Coxeter graph,
, en:Dyck graph, en:Foster
graph en:Biggs-Smith graph. en:W. T.
Tutte
s,
s
. , s
5, s 1
5.
en:Semi-symmetric graph
(
), en:Ljubljana graph 12- en:Tutte
12-cage.

.

en:Brooks' theorem , K4,
. , , K4,
, n/3 , n .
.
3 ,
. .
, , .
, en:Tietze's graph, , , en:double-star snark,
en:Szekeres snark . .
225

. ,
CW en:CW complex.
, , .
en:graph embedding
, .
en:Flag (geometry) ,
, . , ,
.

, . 1880
, en:polyhedral graph .
1946 .. en:W. T. Tutte en:Tait's conjecture,
en:Tutte graph 46 . 1971 , .
, 96 , en:Horton graph..
en:Ellingham-Horton graph.[1]
en:Barnette's conjecture, ,
, .
, LCF en:LCF notation .
n ,
n , ,
n .
en:David Eppstein , n 2n/3
( 1.260n)
. 1.276n.

en:pathwidth n n/6. ,
, 0.082n.
, 1736 ,
, .
en:Petersen's theorem ,
. en:Michael D. Plummer ,
.
. , , n
2n/3656 .
226

. ,
en:pathwidth, (Hie) O(2n/6 + o(n)).
O(1.251n).
APX-, ,
, ,
,
1, P=NP. ,
, en:dominating set
en:maximum cut. en:Crossing number (graph theory)
( , )
NP-, . ,
NP- , 1153/1152.

[1] Ellingham, M. N. "Non-Hamiltonian 3-Connected Cubic Partite Graphs."Research Report No. 28, Dept. of Math., Univ. Melbourne,
Melbourne, 1981.

Cubic symmetric graphs (The Foster Census) (http://mapleta.maths.uwa.edu.au/~gordon/remote/foster/
)( (http://web.archive.org/web/*/http://mapleta.maths.uwa.edu.au/~gordon/
remote/foster/)).
Weisstein, Eric W. Bicubic Graph (http://mathworld.wolfram.com/BicubicGraph.html)(.)
Wolfram MathWorld.
Weisstein, Eric W. Cubic Graph (http://mathworld.wolfram.com/CubicGraph.html)(.) Wolfram
MathWorld.
227
8x8
nm
nm(n + m)/2 - nm
3 ( max(n,m) 3)
max(n, m)

-

en:well-covered graph
,
, .

, 4,
.

nm nm.
(x,y), 1xn 1ym. (x1,y1) (x2,y2) ,
x1=x2, y1=y2. , (
).
nm nm. nn
.
en:Hamming graph.
nm Kn Km.
2n .
228

- (n+m2)-. ,
(Elkies). mn,
. n=m,
, .
.
, ,
.
. ,
,

, , -.
m n , SmSn
Cmn=CmCn, mn .
, , .

Kn,m. ,
Kn,m
,
.
, i j
,
(i,j).

, ,
.
33 , ,
, ,
, ,
.

, .
,
. , ,
(Chudnovsky, Robertson,
Seymour, Thomas 2006) , ,
. , .
, , ,
.
max(m,n), . n-
nn
nn n ,
.
229
, .

,
. ,
. ,

. ( )
. , ,
min(m,n). .

(Moon 1963) m n , :
mn , n+m2 .
mn(m1)/2 m2 , mn(n1)/2 n2
.
4 .
n=m, , nn
srg(n2,2n2,n2,2),
nn n4. n=4,
, , en:Shrikhande graph, ,
44. 44 ,
6, .
230

en:domination number
.
, ,
. mn min(m,n) ( .., .. 1987).
k- ,
( ) k . k-
,
( ) k k1 .
k- k- k-
k- , . k k-
nk/2 n(k22k)/4 k<2n. k- n(k+1)/2 k
2n (Burchett, Lane, Lachniet 2009).

Jn BekaKn-decomposition of the line graphs of complete bipartite graphs // Octogon Mathematical
Magazine. 2001. .1A. .9. .135139.
Bekmetjev, Airat & Hurlbert, Glenn (2004), "The pebbling threshold of the square of cliques", ariv:
math.CO/0406157 (http://www.arxiv.org/abs/math.CO/0406157) [math.CO]
Berger-Wolf, Tanya Y. & Harris, Mitchell A. (2003), "Sharp bounds for bandwidth of clique products", ariv:
cs.DM/0305051 (http://www.arxiv.org/abs/cs.DM/0305051) [cs.DM]
Paul Burchett, David Lane, Jason LachnietK-domination and k-tuple domination on the rook's graph and other
results // Congressus Numerantium. 2009. .199. .187204..
Maria Chudnovsky, Neil Robertson, Paul Seymour, Robin ThomasThe strong perfect graph theorem // Annals of
Mathematics. 2006. .1. .164. .51229. DOI: 10.4007/annals.2006.164.51 (http://dx.doi.
org/10.4007/annals.2006.164.51)
Noam ElkiesGraph theory glossary.
A. J. HoffmanOn the line graph of the complete bipartite graph // Annals of Mathematical Statistics. 1964.
.2. .35. .883885. DOI: 10.1214/aoms/1177703593 (http://dx.doi.org/10.1214/aoms/
1177703593)
van der Hofstad, Remco & Luczak, Malwina J. (2008), "Random subgraphs of the 2D Hamming graph: the
supercritical phase", ariv: 0801.1607 (http://www.arxiv.org/abs/0801.1607) [math.PR]
Renu Laskar, Charles WallisChessboard graphs, related designs, and domination parameters // Journal of
Statistical Planning and Inference. 1999. .12. .76. .285294. DOI:
10.1016/S0378-3758(98)00132-3 (http://dx.doi.org/10.1016/S0378-3758(98)00132-3)
van der Hofstad, Remco; Luczak, Malwina J. & Spencer, Joel (2008), "The second largest component in the
supercritical 2D Hamming graph", ariv: 0801.1608 (http://www.arxiv.org/abs/0801.1608) [math.PR]
G. MacGillivray, K. SeyffarthClasses of line graphs with small cycle double covers // Australasian Journal of
Combinatorics. 2001. .24. .91114.
J. W. MoonOn the line-graph of the complete bigraph // Annals of Mathematical Statistics. 1963. .2.
.34. .664667. DOI: 10.1214/aoms/1177704179 (http://dx.doi.org/10.1214/aoms/1177704179)
D. de Werra, A. HertzOn perfectness of sums of graphs // Discrete Mathematics. 1999. .13.
.195. .93101. DOI: 10.1016/S0012-365X(98)00168-X (http://dx.doi.org/10.1016/
S0012-365X(98)00168-X)
.., .. . Dover, 1987.
231

Weisstein, Eric W. Lattice Graph (http://mathworld.wolfram.com/LatticeGraph.html)(.) Wolfram
MathWorld.

,
en:Structural rigidity
. ,
n G, , -,
k G, k
, , 2k3 , -,
G 2n3 .
, ,
,
1970
.

en:Structural rigidity :

,
, , K3,3,

,

. , , ,
. ,
- . 2n3
2n n ,
. ,
, . ,
, en:rigidity
matroid.
n , 2n (
), (
). ,
, 2n3 2n
. 2n3
. ,
, ,
, .
232

en:pseudotriangle. ,
, ,
. . ,
, , K3,3.

(Streinu, Theran 2008) -,
, -, -
. , ,
(2,3)- , (2,3)- .
, ,
en:pseudoforest, en:arboricity.

(Lebrecht Henneberg)
( , )
. ,

,
, ,
:
1. ,

.
2. ,
.
, ,
. , K3,3
,
.

233

,

.
: ,
,

.

,
. (: 2, 4, 5 6)
. 14,
.
V
E. (1736).
.
.
, :
.

() .
(v,e), e v
. v deg(v) , deg(v) (
). , .
, .
2|E|. ,
.
. ,
( ).
(2|E|), , . . .

, k- n kn/2 .
, k , k.

, .
, ( ,
).
234

-
.

, & , (1999), " Some graphic uses of an even number of odd nodes (http://www.
numdam.org/item?id=AIF_1999__49_3_815_0)", Annales de l'Institut Fourier .49(3): 815827.
, . (1736), " Solutio problematis ad geometriam situs pertinentis (http://math.dartmouth.edu/~euler/
docs/originals/E053.pdf)", Commentarii Academiae Scientiarum Imperialis Petropolitanae .8: 128140.
: , . .; , . K. & , . . (1976), Graph Theory 17361936, Oxford
University Press.
, . (1994), " On the complexity of the parity argument and other inefficient proofs of
existence (http://dx.doi.org/10.1016/S0022-0000(05)80063-7)", Journal of Computer and System Sciences
.48(3): 498532, DOI 10.1016/S0022-0000(05)80063-7.
, A. . (1978), "Hamiltonian cycles and uniquely edge colourable graphs" (http://dx.doi.org/10.
1016/S0167-5060(08)70511-9), Advances in Graph Theory (Cambridge Combinatorial Conf., Trinity College,
Cambridge, 1977), vol. 3, Annals of Discrete Mathematics, . 259268, DOI 10.1016/S0167-5060(08)70511-9.

( ). ,
.

, ,
. 1 ( , )
. 2 :
.
,
,
, .
. ,
.
235

,
.
0 1
, .
.
. :
, , :

, ,
, .

1 4 .
236

,
.

,
. .
.

.
.
.

, .
:
3 4 .

( ) ,
.
237

,
(() ). ,
. (
).
<x,y> "-1" x
<x,y> "1" y <x,y>; ,
"0".

, , .
( 1 -1 ),
.

[1]

1. . . .: . 1973. 300 .

[1] http:/ / kvodo. ru/ incidence-matrix. html
238

(.Laplacian matrix) .
( ),
.

.
:
, ,
, :
, .
, .
() , () .
() .
,
.

239

() :
:
.

.
(. ).
,
(resistance distance) :
( ) ,
2- , ,
.
.
0 ( ),
.
.
, .
240

G n ( 1 n)
A n, aij i-
j- .
, , ( i- )
, aii i-
.
( )
.

A.
1,
( ), .
aij , , (
) .
, , .

,
.
, .
G1 G2 A1 A2
P,
PA1P-1 = A2.
, A1 A2 , ,
.
.
241

A G, Am : i- ,
j- i- j-, m .

,

,
, .
, ,
,
, .
, (, -),
0 1, ,
.
(.sentinel), , 0 .

, ., , ., , ., , . : = Introduction to
Algorithms / . . . . 2- . .: , 2005. 1296. ISBN 5-8459-0857-4

. C++ [1]
/
C# [2]

[1] http:/ / kvodo. ru/ adjacency-matrix. html
[2] http:/ / ideone. com/ FDCtT0
242

,
, a, b, c
m(a,b,c),
a, b
c.
,
(Birkhoff, Kiss 1947) ( )
(Avann 1961), "
" 1971 (Nebesk'y 1971). en:Fan

Chung, en:Ronald Graham (Saks), "

".
, en:maximum parsimony
.[1] en:social
choice theory ,
.[2]
Klavar, Mulder 1999, Bandelt, Chepoi 2008 Knuth 2008.

.[3]
a,
b c , ,
, ,
.
, m(a,b,c) a, b c,
,
. , ,
,
.
.
- m(a,b,c)
a, b c. , ,
en:integer
lattice ,
.[4]
,
,
.
243
, ,

,
.[5]
, .
-en:simplex graph (G)
G
( ) G
.

, ,
. - , .
.
, , ,
a, b c, , .

a b
, d(x,y). , a b,

I(a,b) = {v | d(a,b) = d(a,v) + d(v,b)}.
, a, b c
:
a, b c |I(a,b) I(a,c) I(b,c)| = 1.
, a, b c m(a,b,c),

d(a,b) = d(a,m(a,b,c)) + d(m(a,b,c),b)
d(a,c) = d(a,m(a,b,c)) + d(m(a,b,c),c)
d(b,c) = d(b,m(a,b,c)) + d(m(a,b,c),c)
m(a,b,c) , .
2-, ,
, ,
(windex) 2. .
244

en: .
, .
, ,
.
,
[6]
m(a,b,c) = (a b) (a c) (b c) = (a b) (a c) (b c),
,
0 1
en:median algebra:
: m(a,a,b) = a a b.
: m(a,b,c) = m(a,c,b) = m(b,a,c) = m(b,c,a) = m(c,a,b)
= m(c,b,a) a, b, c.
: m(a,m(b,c,d),e) = m(m(a,b,e),c,m(a,d,e)) a,
b, c, d, e.
: m(0,a,1) = a a.
:[7]
,
: m(x,w,m(y,w,z)) = m(m(x,w,y),w,z)
.

:
I(a,b) = {x | m(a,x,b) = x} = {x | a b x a b}.[8]
a b, I(a,b) = {a,b}.
a b I(a,b), ,
a b , .
a, b c, m(a,b,c) I(a,b), I(a,c)
I(b,c).[9] , .
, G 0 1,
(, m(0,a,1) = a a),
, a b = m(a,0,b) a b = m(a,1,b), G .[10]
(Duffus, Rival 1983)

. , m,
, , , ,
. ,
, ( 0 1)
.
245

, S , a b,
S, I(a,b) S. ,
, S ,
, , S. ,
.[11]
en:Helly property: F
, F
.[12] , F S, T U. a S T, b
T U, c S U. a b
T , , ,
, m(a,b,c)
, . F
, ,
F , .
, ,
,
Wuv = {w | d(w,u) < d(w,v)},
uv . , Wuv ,
u, v, , , w, v w u.
, Wuv , , w1w2...wk ,
Wuv. w2 Wuv,
m1=m(u,w1,wk) m2=m(m1,w2...wk) u, w1, wk,
, . ,
Wuv Wuv, Wuv
, .
Wuv
2-.
2-
2-en:2-satisfiability,

, .[13]
2- ,
en:Constraint (mathematics) ,
. ,
,
,
en:truth value ,
, , ,
.
, .
, . ,
,
246
, , .
, G
2-. , 2-,
(
)
v, v. v
G 2-, v.
v , v
Wuw , w u.
Wuw. , 2-
G.

G G
. ,
en:graph homomorphism G , (v)
= v v (G).
G.
: (v) (w) v w
v w, ,
v w (G). ,
G:
G.
.
G , a, b c
(G), (m(a,b,c))
a, b c, , m(a,b,c). , (G)
. ,
.[14]
, k-
, ,
k- , . a, b c
, a, b c.
,
.
, .[15]
2-. G
2-. ,
.
. ,
, 2-, ,
, ,
, .
, ,
, G . ,
, en:partial cube.
247
, . ,
, .
(Imrich, Klavar 2000) ,
O(mlogn), n m .[16]

, ,
, , ,
(Imrich, Klavar, Mulder 1999),
.[17] ,
,
, O(m1.41),[18]
, ,

.
.
, , G
, . G H,
, G. H
. H G
, G. H
, G
a, b c G, {a,b}, {a,c} {b,c} H,
{a,b,c}, G
H. , G , H
. , G , H -en:simplex
graph. , H ,
G.
, H G.
, , ,
(Hagauer, & Imrich, Klavar
1999), .

, ,
, .
. ,
. ,
, ,
. , ,
.
(m3/2), . (Hagauer
.) , , , ,
(Alon .) .
248
,

.

,

.

,
, .

en:perfect phylogeny, ,
( ), ,
. ,
en:maximum parsimony , , ,
, ,
.
(Buneman 1971)
, .
,
[19] en:phylogenetic network.
, ,

. ,
. ,
.
,
, ,
.
, .
, ,
, .
,
, ( ,
) .
, , ,
. , ,
, .
,
en:family of sets ,
249
. ,
, . ,
en:Helly property .
(Wuv, Wvu),
uv ,

.
Bandelt, Forster, Sykes, Richards 1995 Bandelt, Macaulay, Richards 2000

.

.

,

.

en:lookahead, .
,
si ti,
d(si,ti) d(ti1,ti). ,
windex 2. , ti = m(ti1,si,si+1).
.
a, b c
, a, b c m(a,b,c). (Bandelt, Barthlmy 1984)
, en:Geometric median
, ,
. , S
en:Condorcet criterion :
S.
, n (n/2) log2 n .
: , (Klavar, Mulder,
krekovski 1998) , 2nmk2, m
k , .
, .
: (-1)dim(Q) ,
Q .
.
250

[1] ,,.
[2] ,.
[3] , 1.26, . 24.
[4] , .
[5] ,,.
[6] .
[7] , . 65, 75, 76 8990. , ,
.
[8] ,
, 1 .
[9] , 2.
[10] , . 751.
[11] , , .
[12] , 2.40, . 77.
[13] , 2.5, .8; ; ; , S, . 72.
[14] , 1.33, . 27.
[15] ; , 2.39, .76; , . 74.
[16] , 7.10 . 218 ,
4 G, , G
4 .
. , H, . 69.
[17] . , . . , .
[18] . . m , O
. O(m3/2).
m n ( ), , m = O(n log n).
[19] , .
.

Noga Alon, Yuster Raphael, Zwick UriColor-coding // Journal of the Association for Computing Machinery.
1995. .4. .42. .844856. DOI: 10.1145/210332.210337 (http://dx.doi.org/10.1145/210332.
210337).
AvannMetric ternary distributive semi-lattices // Proceedings of the American Mathematical Society.
American Mathematical Society, 1961. .3. .12. .407414. DOI: 10.2307/2034206 (http://dx.
doi.org/10.2307/2034206).
BandeltRetracts of hypercubes // Journal of Graph Theory. 1984. .4. .8. .501510. DOI:
BandeltMedians in median graphs // Discrete Applied Mathematics. 1984. .2. .8. .131142.
DOI: 10.1016/0166-218X(84)90096-9 (http://dx.doi.org/10.1016/0166-218X(84)90096-9).
BandeltMetric graph theory and geometry: a survey // Contemporary Mathematics. 2008., to appear.
Hans-Jrgen Bandelt, P. Forster, B. C. Sykes, Martin B. RichardsMitochondrial portraits of human populations
using median networks // Genetics. .2. .141. .743753. PMID 8647407..
Hans-Jrgen Bandelt, P. Forster, Arne RohlMedian-joining networks for inferring intraspecific phylogenies //
Molecular Biology and Evolution. .1. .16. .3748. PMID 10331250..
Hans-Jrgen Bandelt, Vincent Macaulay, Martin B. RichardsMedian networks: speedy construction and greedy
reduction, one simulation, and two case studies from human mtDNA // Molecular Phylogenetics and
Evolution. 2000. .1. .16. .828. DOI: 10.1006/mpev.2000.0792 (http://dx.doi.org/10.
1006/mpev.2000.0792) PMID 10877936..
Jean-Pierre BarthlmyFrom copair hypergraphs to median graphs with latent vertices // Discrete
Mathematics. 1989. .1. .76. .928. DOI: 10.1016/0012-365X(89)90283-5 (http://dx.doi.
org/10.1016/0012-365X(89)90283-5).
251
Garrett Birkhoff , S. A. KissA ternary operation in distributive lattices // Bulletin of the American Mathematical
Society. 1947. .1. .53. .749752. DOI: 10.1090/S0002-9904-1947-08864-9 (http://dx.doi.
org/10.1090/S0002-9904-1947-08864-9).
P. Buneman Mathematics in the Archaeological and Historical Sciences. Edinburgh University Press, 1971.
.387395..
V. Chepoi, F. Dragan, Y. VaxsProc. 13th ACM-SIAM Symposium on Discrete Algorithms. 2002.
.346355..
V. Chepoi, C. Fanciullini, Y. VaxsMedian problem in some plane triangulations and quadrangulations //
Computational Geometry: Theory & Applications. 2004. .27. .193210..
N. Chiba, T. NishizekiArboricity and subgraph listing algorithms // SIAM Journal on Computing. 1985.
F. R. K. Chung, R. L. Graham, M. E. Saks Discrete Algorithms and Complexity (Kyoto, 1986). New York:
Academic Press, 1987. .15. .351387. (Perspectives in Computing)..
F. R. K. Chung, R. L. Graham, M. E. SaksA dynamic location problem for graphs // Combinatorica. 1989.
William H. E. Day, F. R. McMorris Axiomatic [sic] Theory in Group Choice and Bioinformatics. Society for
Industrial and Applied Mathematics, 2003. .9194. ISBN 0-89871-551-2.
A. Dress, M. Hendy, K. Huber, V. MoultonOn the number of vertices and edges of the Buneman graph // Annals
of Combinatorics. 1997. .1. .1. .329337. DOI: 10.1007/BF02558484 (http://dx.doi.org/
10.1007/BF02558484).
A. Dress, K. Huber, V. MoultonSome variations on a theme by Buneman // Annals of Combinatorics. 1997.
Dwight Duffus, Ivan RivalGraphs orientable as distributive lattices // Proceedings of the American Mathematical
Society. American Mathematical Society, 1983. .2. .88. .197200. DOI: 10.2307/2044697
(http://dx.doi.org/10.2307/2044697).
T. FederStable Networks and Product Graphs. 1995. .555..
Johann Hagauer, Wilfried Imrich, Sandi KlavarRecognizing median graphs in subquadratic time // Theoretical
Computer Science. 1999. .12. .215. .123136. DOI: 10.1016/S0304-3975(97)00136-9
(http://dx.doi.org/10.1016/S0304-3975(97)00136-9).
Pavol HellColloquio Internazionale sulle Teorie Combinatorie (Roma, 1973), Tomo II. Rome: Accad. Naz.
Lincei, 1976. .17. .263268..
Wilfried Imrich, Sandi KlavarA convexity lemma and expansion procedures for bipartite graphs // European
Journal of Combinatorics. 1998. .6. .19. .677686. DOI: 10.1006/eujc.1998.0229 (http://
dx.doi.org/10.1006/eujc.1998.0229).
Wilfried Imrich, Sandi KlavarProduct Graphs: Structure and Recognition. Wiley, 2000. ISBN
0-471-37039-8..
Wilfried Imrich, Sandi Klavar, Henry Martyn MulderMedian graphs and triangle-free graphs // SIAM Journal on
dx.doi.org/10.1137/S0895480197323494).
A. Itai, M. RodehFinding a minimum circuit in a graph // SIAM Journal on Computing. 1978. .4.
Pranava K. Jha, Giora SlutzkiConvex-expansion algorithms for recognizing and isometric embedding of median
graphs // Ars Combinatorica. 1992. .34. .7592..
Sandi Klavar, Henry Martyn MulderMedian graphs: characterizations, location theory and related structures //
Journal of Combinatorial Mathematics and Combinatorial Computing. 1999. .30. .103127..
Sandi Klavar, Henry Martyn Mulder, Riste krekovskiAn Euler-type formula for median graphs // Discrete
Mathematics. 1998. .1. .187. .255258. DOI: 10.1016/S0012-365X(98)00019-3 (http://dx.
252
doi.org/10.1016/S0012-365X(98)00019-3).
Donald E. Knuth The Art of Computer Programming. Addison-Wesley, 2008. .IV, Fascicle 0:
Introduction to Combinatorial Algorithms and Boolean Functions. .6474. ISBN 978-0-321-53496-5
. . , -, : ". . ",
2013. .4A, . 1. .90 101. ISBN 978-5-8459-1744-7 ()
Henry Martyn Muldern-cubes and median graphs // Journal of Graph Theory. 1980. .1. .4.
.107110. DOI: 10.1002/jgt.3190040112 (http://dx.doi.org/10.1002/jgt.3190040112).
Henry Martyn Mulder, Alexander SchrijverMedian graphs and Helly hypergraphs // Discrete Mathematics.
1979. .1. .25. .4150. DOI: 10.1016/0012-365X(79)90151-1 (http://dx.doi.org/10.1016/
0012-365X(79)90151-1).
Ladislav Nebesk'yMedian graphs // Commentationes Mathematicae Universitatis Carolinae. 1971.
.12. .317325..
Riste krekovskiTwo relations for median graphs // Discrete Mathematics. 2001. .1. .226.
.351353. DOI: 10.1016/S0012-365X(00)00120-5 (http://dx.doi.org/10.1016/S0012-365X(00)00120-5).
.., .., ..
. : , 1973.

Median graphs (http://wwwteo.informatik.uni-rostock.de/isgci/classes/gc_211.html), Information System
for Graph Class Inclusions.
Network (http://www.fluxus-engineering.com/sharenet.htm), Free Phylogenetic Network Software. Network
generates evolutionary trees and networks from genetic, linguistic, and other data.
PhyloMurka (http://sourceforge.net/projects/phylomurka), open-source software for median network
computations from biological data.
() 253
()
( ) ,
:
a b,
,
.
, ,
L
( , ,
) N
, [1]:
,
.
= 1,917
= 1.803.
, = 0.522
.
. ,
, -, , [],
.
(.). 1998

[1]. ,

,

( ). []
,
(.).,
( = 1,417
) = 2.109.
= 0.167
. ,

, , .
,
(.)., (i) , (ii)
. (,
) 1999[2].
[3][4][5].
() 254

-,
, .
, (). -,
. : (
) .
[6]:

, , .
, .
, .
, (
, , ) - ,
.
( , ) ,
( (.).).
, , , ,
.
(). ,
(), ,
. .
,
( ).

[7].

,
- [8].
( ) ,

-
. () [9][10] , -
. , - , ,
() 255

, ,
, , (metabolite processing networks),
, , .
() ,
[11].
, ,
, , - -
[12].
,
, ,
- ,
. ,
, , ,
.
, . ,
- , . ,
30,
. :
10 , ,
.
, , , .
, , ,
, . ,
(
18001850) , .
, ,
( , -
()).

(, Barabsi() ) ,

. ,
.
, ,
.
()
(
(.)). ,
(.), , ,
.
, (.),
. , ,
() 256
, ,
. , ,
. , , ,
,
.
, ,
,
, .
, .
, ,
.
, , -,
p53, ,
.

- -(.)
[13], ,
[14] [15].
(.) ,
, ( ) .
,
.
[16],
.
. ,
ultra small-world , ,
.
: en:Diffusion-limited aggregation, en:pattern formation

, .
,
[17].
(),
().
, ,
. , ,
, ,
, .
[18]. ()
, , ,
[17].
, ,
() 257
.
, 1999
().

, , . ,
, [19].
[20].
,
.

,
. Small World Data Transformation Measure[21][22].
,
. ,
.
P2P- Freenet ,[23]
, .

[24] [25]
.
. ,
.[26][27], ;
(.). .
.
. : (
) ( ).
,
, [28].

,
,
[29].

.
! : , .
.
( , , - - ).
. ,
() 258
.
[30].
WordNet
. - [31].
(), , , , ,
[32].
.
. ,
(, ..). , ,
, , . ,
[33]. ,
, (, , ,
), ,
,
[34].
,
, , .
,
, .
[35].
[36], 5 .

[1] Collective dynamics of small-world networks
[2] Barthelmy and Amaral
[3] Barrat and Weigt
[4] Dorogovtsev and Mendes
[5] Barmpoutis and Murray
[6] Complex networks Structure and dynamics, . 8
[7] Humphries
[8] Telesford, Joyce, Hayasaka, Burdette, Laurienti
[9] Cohen and Havlin and ben-Avraham
[10] Scale-free networks are ultrasmall
[11] Proteins, . 292299
[12] Gene network, . 280-4
[13] Fractals with time-delay, . 215219
[14] Chaos in small-world networks
[15] Transition to chaos
[16] BarmpoutisMurray2010
[17] Shirky
[18] Finnegan
[19] Yang
[20] Jimenez, Tiampo, Posadas
[21] Information Theory & Business Intelligence Strategy
[22] Hillard
[23] Sandberg
[24] Sporns
[25] Yu
[26] Cohen
[27] Solla
[28] Humphries, . 367-375
[29] Dimension of spatially embedded networks
() 259
[30] Sole
[31] WordNet, p. 1
[32] WordNet
[33] Antiqueira, p. 4
[34] Antiqueira
[35] Masucci
[36] http:/ / pikabu. ru/ story/ zanyatnaya_igra_1646567

Robert Hillard Information-Driven Business. Wiley, 2010. ISBN 978-0-470-62577-4
() Here Comes Everybody. Penguin Group, 2008. ISBN 978-1-59420-153-0
M. D. Humphries, K. Gurney and T. J. Prescott, Phil. Trans (2007). Is there a brainstem substrate for action
selection?. R. Soc. B. DOI: 10.1098/rstb.2007.2057 (http://dx.doi.org/10.1098/rstb.2007.2057).
K.E. Joyce, S. Hayasaka, J.H. Burdette, P.J. Laurienti (2011). The ubiquity of small-world networks Q.K.
Telesford,. Brain Connect: 367-75. DOI: 10.1089/brain.2011.0038 (http://dx.doi.org/10.1089/brain.2011.
0038).
Finnegan, William (2003). Affinity Groups and the Movement Against Corporate Globalization (en)
(Wiley-Blackwell) 1: 210-218.
X. S. Yang (2001). Small-world networks in geophysics. Geophys. Res. Lett., 28(13): 25492552.
A. Jimenez, K. F. Tiampo, A. M. Posadas (2008). Small-world in a seismic network: the California case.
Nonlin. Processes Geophys., 15: 389395.
Sporns, Olaf; Tononi G, Edelman GM (2004.). Organization, development and function of complex brain
networks. Trends Cogn Sci. 8 (9): 418425.. DOI: 10.1016/j.tics.2004.07.008 (http://dx.doi.org/10.1016/j.
tics.2004.07.008). PMID 15350243.
Yu, Shan; D. Huang, W. Singer and D. Nikoli (2008). A Small World of Neuronal Synchrony. Cerebral
Cortex 18 (12): 28912901. DOI: 10.1093/cercor/bhn047 (http://dx.doi.org/10.1093/cercor/bhn047). PMID
18400792.
M.Barthelemy, L.Amaral (1999). Small-world networks: Evidence for a crossover picture. Phys. Rev. Lett. 82
(15). DOI: 10.1103/PhysRevLett.82.3180 (http://dx.doi.org/10.1103/PhysRevLett.82.3180). Bibcode:
1999PhRvL..82.3180B (http://adsabs.harvard.edu/abs/1999PhRvL..82.3180B).
R.Cohen, S.Havlin, and D.ben-Avraham (2002). Structural properties of scale free networks (http://havlin.biu.
ac.il/Publications.php?keyword=Structural+properties+of+scale+free+networks&year=*&match=all).
Handbook of graphs and networks (Wiley-VCH, 2002) (Chap. 4).
R. Cohen, S.Havlin (2003). Scale-free networks are ultrasmall (http://havlin.biu.ac.il/Publications.
php?keyword=Scale-free+networks+are+ultrasmall++&year=*&match=all). Phys. Rev. Lett. 90 (5):
058701. DOI: 10.1103/PhysRevLett.90.058701 (http://dx.doi.org/10.1103/PhysRevLett.90.058701). PMID
12633404. Bibcode: 2003PhRvL..90e8701C (http://adsabs.harvard.edu/abs/2003PhRvL..90e8701C).
P.Bork, LJ Jensen, C. von Mering, A.Ramani, I.Lee, EM.Marcotte (2004). Protein interaction networks from
yeast to human (http://polaris.icmb.utexas.edu/paper-pdfs/cosb-review.pdf) (PDF). Current Opinion in
Structural Biology 14 (3): 292299. DOI: 10.1016/j.sbi.2004.05.003 (http://dx.doi.org/10.1016/j.sbi.2004.
05.003). PMID 15193308.
V.Van Noort, B.Snel, MA.Huynen (Mar 2004). The yeast coexpression network has a small-world, scale-free
architecture and can be explained by a simple model. EMBO Rep. 5 (3): 280284. DOI:
10.1038/sj.embor.7400090 (http://dx.doi.org/10.1038/sj.embor.7400090). PMID 14968131.
X. S. Yang (2002). Fractals in small-world networks with time-delay (http://arxiv.org/pdf/1003.4949.pdf).
Chaos, Solitons & Fractals 13: 215219.
() 260
X. S. Yang (2001). Chaos in small-world networks (http://arxiv.org/pdf/1003.4940.pdf). Phys. Rev. E 63,

046206.
W. Yuan, X. S. Luo, P. Jiang, B. Wang, J. Fang. Transition to chaos in small-world dynamical network (http://
nlsc.ustc.edu.cn/phpcms/uploadfile/common/research/12/5.pdf).
D.Barmpoutis and R.M. Murray (2010). Networks with the Smallest Average Distance and the Largest Average
Clustering.
D. Li, K. Kosmidis, A. Bunde, S. Havlin (2011). Dimension of spatially embedded networks (http://havlin.biu.
ac.il/Publications.php?keyword=Dimension+of+spatially+embedded+networks&year=*&match=all).
Nature Physics. DOI: 10.1038/nphys1932 (http://dx.doi.org/10.1038/nphys1932). Bibcode:
2011NatPh...7..481D (http://adsabs.harvard.edu/abs/2011NatPh...7..481D).

Duncan J. Watts & Steven H. Strogatz. Collective dynamics of small-world networks (http://worrydream.com/
ScientificCommunicationAsSequentialArt/ScientificCommunicationAsSequentialArt.pdf)(.). Nature
Publishing Group, a division of Macmillan Publishers Limited. (1999).
A.Barrat and M.Weigt. On the properties of small-world network models (http://arxiv.org/abs/cond-mat/
9903411)(.). Europ. Phys. J. B 13, 547 (2000) (1999).
S.N. Dorogovtsev, J.F.F. Mendes. Evolution of networks (http://arxiv.org/abs/cond-mat/0106144)(.). Adv.
Phys. 51, 1079 (2002) (2002).
Dionysios Barmpoutis, Richard M. Murray. Noise Propagation in Biological and Chemical Reaction Networks
(http://arxiv.org/abs/cond-mat/0106144)(.). California Institute of Technology.
S. Boccaletti, V. Latora, Y. Moreno, M. Chavez., D.-U. Hwang. Complex networks: Structure and dynamics
(http://www.u-cergy.fr/_attachments/complex-systems-i-article/latora_phys_rep.pdf?download=true)(.).
Elsevier.
Mariano Sigman, Guillermo A. Cecchi. Global organization of the Wordnet lexicon (http://data.cogsci.bme.hu/
public_html/DOWNLOAD/PHD_iskola/docs/csaba/wordnet.pdf) (2001).
Information Theory & Business Intelligence Strategy Small Worlds Data Transformation Measure
MIKE2.0, the open source methodology for Information Development (http://mike2.openmethodology.org/
wiki/Small_Worlds_Data_Transformation_Measure).
Sandberg, Oskar Searching in a Small World (https://freenetproject.org/papers/lic.pdf).
Cohen, Philip. Small world networks key to memory (http://www.newscientist.com/article.ns?id=dn5012) (26
May 2004).
Sara Solla. Lecture & Slides: Self-Sustained Activity in a Small-World Network of Excitable Neurons (http://
online.itp.ucsb.edu/online/brain04/solla/).
Lucas Antiqueira, Thiago Alexandre Salgueiro Pardo, Maria das Gra cas Volpe Nunes, Osvaldo Novais de
Oliveira Jr., Luciano da Fontoura Costa. Some issues on complex networks for author characterization (http://
citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.94.3070&rep=rep1&type=pdf) (2006). doi:
10.1.1.94.3070 (http://dx.doi.org/10.1.1.94.3070).
Adolfo Paolo Masucci, Alkiviadis Kalampokis, Victor Martnez Eguluz, Emilio Hernndez-Garca. Wikipedia
Information Flow Analysis Reveals the Scale-Free Architecture of the Semantic Space (http://www.plosone.
org/article/info:doi/10.1371/journal.pone.0017333)(.) (28.02.2011). doi: 10.1371/journal.pone.001733
(http://dx.doi.org/10.1371/journal.pone.001733).
Ricard V. Sole, Bernat Corominas Murtra, Sergi Valverde, Luc Steels. Language Networks: their structure,
function and evolution (http://www.researchgate.net/publication/
230766802_Language_Networks_Their_Structure_Function_and_Evolution/file/d912f50b3a706a7a5c.pdf)
(09/2007).
() 261
Dynamic Proximity Networks (http://demonstrations.wolfram.com/DynamicProximityNetworks/) by Seth J.

Chandler, The Wolfram Demonstrations Project.
Small-World Networks (http://www.scholarpedia.org/article/Small-world_network) entry on Scholarpedia (by
Mason A. Porter)

- ()
.
( ) , (, , ,
).

. ,
, (- )
. -
, .
:

()
. ,
.
, ,
.
, . ,
, , . B ,
A B.
. , /
, .
, , , ,
, . ,
.
.
,
(
) , .
, , .
262

.

1,
.

.

,

. , ,
i
:
i- ,

.

(), ,
,
.
.
,
. 50
m=1.
263

,
.
,
, ,
.
.

.

, -
. ,
, , , .

. ,
, ,
.
:
, .
, :
, .[1]

. , ,
.

, .
.
, .
264
B
B , .
,
. ,
, , .
.
B ,
,
.

, 1925 ,
- .
, ,
1955 .
1976,
.
- ,
1999
.

[1] S.N. Dorogovtsev, A.V. Goltsev, and J.F.F. Mendes, e-print cond-mat/0112143.

265

, -
,
, .
.
, , ,
. , ,
,
, .

.
, .
.
,
, .
, . [1]
,
, , ( )
( ).[2]

[1] . . . .: , 2001. 532c. ISBN 5-03-003363-7
[2] .. (- ), ... . . .
. .: , 2001. . 6.

, . . (http://files.rushim.ru/books/
obzor/himicheskie-prilozhenia-grafov.djvu) = Chemical Applications of Topology and Graph Theory, ed. by R.
B. King. .: , 1987. 560.
( ) 266
( )
,
.
,
).
,
.

,
. ,
, , ,
6 ( )
.

,
, ,
. (
.)
2-
,
. -
.
,

, , ,
. , 1, ,
, . ,
2-, 2-.
.
( ) 267

, , .
en:ear decomposition,
2-, ( en:Robbins' theorem)
en:strong orientation.
, , en:cycle
double cover conjecture, en:Paul Seymour (mathematician) ( 1978 1979,
), , ,
.

, ,
1974. :

en:Tree traversal .
.
(v,w), , , .
:
,
( ).
, , ,
, ( ).
, ,
, .
, , ,
, . ,
, ,
.
, ,
.
, ,
, . L(w),H(w)
, , ,
.
( ) 268

.
, ( )
G, 2- (
3-).
,
T G :
. v
1...n, ( , ),
v, .
.
, , v, . i- ,
, Ci. C=C1,C2,... G .
G C ,
.
C G=(V,E).
1. G 2- , C E.
2. e G , e C.
3. G 2-, C en:ear decomposition.
4. G 2- , G 2 C1
C.
5. v 2- G , v
C - C1.
6. G 2-, C en:ear decomposition.

269

( )
, en:multiple
edges ( ""[1]), ,
. ,
. (
,
, .)

. , ,
, ,
, .
()
, . ().
.
(
)
, G G:=(V, E),
V ,
E . .
.
, , ,
, , .
, , ,[2]
, .
( )
, , ,
. G G:=(V,A),
V ,
A . .
G:=(V,E, A) , en:mixed
graph.
270
( )
( en:Quiver (mathematics)) G G:=(V, A, s,
t),
V ,
A ,
,
,.
( ,
), ,
.
""
.

en:graph labeling .
.
,
.
1: en:graph labeling
.
: G 8 ,

V A
, ,
, ,
, .
2: en:graph labeling
, (, ,
en:graph labeling).

[1] , Balakrishnan, p. 1.
[2] , (Bollobs), 7, (Diestel), 25.

Bla Bollobs Modern Graph Theory. Springer, 2002.
V. K. Balakrishnan Graph Theory. McGraw-Hill, 1997.
. : - - , 3003.
Jonathan L Gross, Jay Yellen Graph Theory and Its Applications. McGraw-Hill, 1998.
Jonathan L Gross, Jay Yellen Handbook of Graph Theory. McGraw-Hill, 2003.
271
. . : , 2003.
Daniel Zwillinger CRC Standard Mathematical Tables and Formulae. Chapman & Hall/CRC, 2002.
Svante Janson, Donald E. Knuth, Tomasz Luczak, Boris PittelThe birth of the giant component // Random
Structures and Algorithms. 1993. .3. .4. .231358. DOI: 10.1002/rsa.3240040303 (http://
dx.doi.org/10.1002/rsa.3240040303)

Paul E. Black, Multigraph at the NIST Dictionary of Algorithms and Data Structures.

,
. (Vizing 1965)
.
,
:
a) .
b) , a) .
, , ,
. .
( , ) .
Sh(2) Sh(3) Sh(4) Sh(5) Sh(6) Sh(7)

272

(Shannon 1949),
,
. ,
,
: ,
,
(Vizing 1964) ,

. ,
.
.
.

S. Fiorini, R.J. Wilson Edge-colourings of graphs. London: Pitman, 1977. .16. .34. (Research
Notes in Mathematics). ISBN 0-273-01129-4
Claude E. ShannonA theorem on coloring the lines of a network // J. Math. Physics. 1949. .28.
.148151..
Lutz Volkmann Fundamente der Graphentheorie. Wien: Springer, 1996. .289. ISBN 3-211-82774-9.
. . - // . . 1964. .3.
.2530..
. . // . 1965. .3. .2939..

Lutz Volkmann: Graphen an allen Ecken und Kanten [1]. Lecture notes 2006, p.242 (German)

[1] http:/ / www. math2. rwth-aachen. de/ files/ gt/ buch/ graphen_an_allen_ecken_und_kanten. pdf
273

, , ,
(Mycielski 1955).
, . ,
,
.

n
G v0, v1, .
(G) G
G n+1
ui
vi G,
w. ui
w,
K1,n. 5- .
, vivj
G uivj viuj.
, G n m , (G) 2n+1 3m+n .

, vi 0 i
4. , 11 20 .
4 (Chvtal 1974).

,
,
Mi =
(Mi-1),
.

M2 M2, M3 M4
= K2 ,
, M3 = C5 11 20 .
Mi , (i-1)- ,
i-. Mi 3 2i-2 1 ( A083329 OEIS). Mi
i
0, 0, 1, 5, 20, 71, 236, 755, 2360, 7271, 22196, 67355, ( A122695 OEIS).
274

G k, (G) k +
1 (Mycielski 1955).
G , (G) .
(Mycielski 1955).
, G (G), (G)
max(2,(G)).(Mycielski 1955).
G - , (G)
(Doli 2005). , Mi i 2
-.
G , (G) (Fisher, M4 ( )
McKenna, Boyer 1998).
G en:domination number (G), (G) (G)+1.
(Fisher, McKenna, Boyer 1998).

, , (Stiebitz 1985)
(Tardif 2001) , , (Lin, Wu, Lam, Gu 2006).
G .
. G m-
,
i- ,
, u. ,
[1]
.

[1] Lin, Wu, Lam, Gu, 2006

Vclav Chvtal Graphs and Combinatorics (Proc. Capital Conf., George Washington Univ., Washington, D.C.,
1973). Springer-Verlag, 1974. .406. .243246. (Lecture Notes in Mathematics)..
Tomislav DoliMycielskians and matchings // Discussiones Mathematicae Graph Theory. 2005. .3.
.25..
David C. Fisher, Patricia A. McKenna, Elizabeth D. BoyerHamiltonicity, diameter, domination, packing, and
biclique partitions of Mycielski's graphs // Discrete Applied Mathematics. 1998. .13. .84.
.93105. DOI: 10.1016/S0166-218X(97)00126-1 (http://dx.doi.org/10.1016/S0166-218X(97)00126-1).
Wensong Lin, Jianzhuan Wu, Peter Che Bor Lam, Guohua GuSeveral parameters of generalized Mycielskians //
Discrete Applied Mathematics. 2006. .8. .154. .11731182. DOI:
10.1016/j.dam.2005.11.001 (http://dx.doi.org/10.1016/j.dam.2005.11.001).
Jan MycielskiSur le coloriage des graphes // Colloq. Math.. 1955. .3. .161162..
275
M. Stiebitz Beitrge zur Theorie der frbungskritschen Graphen. Habilitation thesis, Technische Universitt
Ilmenau, 1985.. (Tardif 2001).
C. TardifFractional chromatic numbers of cones over graphs // Journal of Graph Theory. 2001. .2.
.38. .8794. DOI: 10.1002/jgt.1025 (http://dx.doi.org/10.1002/jgt.1025).

Weisstein, Eric W. Mycielski Graph (http://mathworld.wolfram.com/MycielskiGraph.html)(.)
Wolfram MathWorld.

,
,

,

. ,
S,
,
S,
S S.

,
.
en:dominating set ,
, , ,

.
.[1]

.
, P3, a, b c ab bc, {b} {a,c}
. {a} , ,
{a,c}. {a,b} {b,c}.

, , ,
.
276

S ,
. , ,
. , S ,
S , S ,
S. .
.
, ,
.
, ,
, . , ,
, ,
, , .
,
.[2]
en:dominating set,
, , .
,
.

.
. , ,
, ,
, .[3]
,
.
en:Cograph ,
, .

(Moon, Moser 1965) , n 3n/3
. n 3n/3 . ,
3n/3 , n/3
.
. 3n/3 en:Turn graph
.
-.
k n

, .[4]
277
, ,
. , O(n) ,
,
.[5]
, , , .

n .
n ,
n .[6]
, 1.324718 ( ).

NP- .
,
.
,
.
. (Lawler 1976)
,
3 ,
.
3 , ,
.[7]
. ,
(, ,
).
3n/3
, O(3n/3).[8] ,
,
.
.

.[9]

.[10]
278

[1] , n
UNIQ-math-0-8f7fe296df290bab-QINU UNIQ-math-1-8f7fe296df290bab-QINU .
[2] Weigt, Hartmann, 2001
[3] Information System on Graph Class Inclusions: (http:/ / wwwteo. informatik. uni-rostock. de/
isgci/ classes/ gc_749. html) (http:/ / wwwteo. informatik. uni-rostock. de/ isgci/
classes/ gc_750. html).
[4] . .
[5] . , .
[6] ; ; .
[7] ; .
[8] . .
[9] ; ; ; ; ; ; ; ; ; ; .
[10] ; .

R. Bisdorff, J.-L. MarichalCounting non-isomorphic maximal independent sets of the n-cycle graph. 2007.
ariv:math.CO/0701647.
I. M. Bomze, M. Budinich, P. M. Pardalos, M. Pelillo Handbook of Combinatorial Optimization. Kluwer
Academic Publishers, 1999. .4. .174..
J. M. Byskov Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms.
2003. .456457..
N. Chiba, T. NishizekiArboricity and subgraph listing algorithms // SIAM J. on Computing. 1985. .1.
C. Croitoru Proc. Third Coll. Operations Research. Babe-Bolyai University, Cluj-Napoca, Romania, 1979.
.5560..
D. EppsteinSmall maximal independent sets and faster exact graph coloring // Journal of Graph Algorithms and
Applications. 2003. .2. .7. .131140. ariv:cs.DS/cs.DS/0011009.
D. EppsteinProc. Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms. 2005.
.451459. ariv:cs.DS/0407036.
P. ErdsOn cliques in graphs // Israel J. Math.. 1966. .4. .4. .233234. DOI:
10.1007/BF02771637 (http://dx.doi.org/10.1007/BF02771637).
R. EulerThe Fibonacci number of a grid graph and a new class of integer sequences // Journal of Integer
Sequences. 2005. .2. .8. .05.2.6..
Z. FrediThe number of maximal independent sets in connected graphs // Journal of Graph Theory. 1987.
.4. .11. .463470. DOI: 10.1002/jgt.3190110403 (http://dx.doi.org/10.1002/jgt.3190110403).
E. Jennings, L. MotyckovProc. First Latin American Symposium on Theoretical Informatics. 1992.
.583. .281293.
D.S. Johnson, M. Yannakakis, C. H. PapadimitriouOn generating all maximal independent sets // Information
Processing Letters. 1988. .3. .27. .119123. DOI: 10.1016/0020-0190(88)90065-8 (http://
dx.doi.org/10.1016/0020-0190(88)90065-8).
E. L. LawlerA note on the complexity of the chromatic number problem // Information Processing Letters.
1976. .3. .5. .6667. DOI: 10.1016/0020-0190(76)90065-X (http://dx.doi.org/10.1016/
0020-0190(76)90065-X).
E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy KanGenerating all maximal independent sets: NP-hardness and
polynomial time algorithms // SIAM Journal on Computing. 1980. .3. .9. .558565. DOI:
10.1137/0209042 (http://dx.doi.org/10.1137/0209042).
J. Y.-T. LeungFast algorithms for generating all maximal independent sets of interval, circular-arc and chordal
graphs // Journal of Algorithms. 1984. .5. .2235. DOI: 10.1016/0196-6774(84)90037-3 (http://
279
dx.doi.org/10.1016/0196-6774(84)90037-3).
Y. D. Liang, S. K. Dhall, S. Lakshmivarahan Proc. Symp. Applied Computing. 1991. .465470.
K. Makino, T. Uno Proc. Ninth Scandinavian Workshop on Algorithm Theory. Springer-Verlag, 2004.
.3111. .260272. (Lecture Notes in Compute Science)..
N. Mishra, L. PittProc. Tenth Conf. Computational Learning Theory. 1997. .211217. ISBN
0-89791-891-6. DOI: 10.1145/267460.267500 (http://dx.doi.org/10.1145/267460.267500).
J. W. Moon, L. MoserOn cliques in graphs // Israel Journal of Mathematics. 1965. .3. .2328.
DOI: 10.1007/BF02760024 (http://dx.doi.org/10.1007/BF02760024).
V. StixFinding all maximal cliques in dynamic graphs // Computational Optimization Appl.. 2004. .2.
.27. .173186. DOI: 10.1023/B:COAP.0000008651.28952.b6 (http://dx.doi.org/10.1023/B:COAP.
0000008651.28952.b6)
E. Tomita, A. Tanaka, H. TakahashiThe worst-case time complexity for generating all maximal cliques and
computational experiments. 2006. .1. .363. .2842. DOI: 10.1016/j.tcs.2006.06.015 (http://
dx.doi.org/10.1016/j.tcs.2006.06.015).
S. Tsukiyama, M. Ide, H. Ariyoshi, I. ShirakawaA new algorithm for generating all the maximal independent sets
// SIAM J. on Computing. 1977. .3. .6. .505517. DOI: 10.1137/0206036 (http://dx.doi.
org/10.1137/0206036).
Martin Weigt, Alexander K. HartmannMinimal vertex covers on finite-connectivity random graphs: A
hard-sphere lattice-gas picture // Phys. Rev. E. 2001. .5. .63. .056127. DOI:
10.1103/PhysRevE.63.056127 (http://dx.doi.org/10.1103/PhysRevE.63.056127)
ariv:cond-mat/0011446.
C.-W. Yu, G.-H. ChenGenerate all maximal independent sets in permutation graphs // Internat. J. Comput.
Math.. 1993. .47. .18. DOI: 10.1080/00207169308804157 (http://dx.doi.org/10.1080/
00207169308804157).
280

(.directed acyclic graph, .DAG)
,
, ,

.
(,
).

;

(en:Feedforward neural networks);
: .

DAWG (.directed acyclic word graph) , ,
, .
. , ,
DAWG , .
:
. , ,
. DAWG
( ).
281

On

,

en:set system.

.

On
O3 = KG5,2 = \tbinom
(n1)- {2n-1}{n-1} = n\tbinom {2n-1}{n-1}/2
= n1 =
(2n1) .
3 n = 2,
5 n = 3,
, 6 n > 3 =
-
- = On
. , On
en:Kneser graph
KG(2n1,n1), O2 ,
O3 .

en:folded
cube graph,
-
n1
2n1 n.

1898,

(Kowalewski 1917),

O4.[1]

O4 = KG7,3
en:chemical graph theory

en:carbonium ion.
.
282
On en:Norman Biggs (mathematician)

1972. en:Tony Gardiner
1974 X,
"odd man out" ( " "),
, ,
.

On n. .
, n = 1, 2,...
1, 3, 10, 35, 126, 462, 1716, 6435 ( A001700 OEIS).

On , k ,
2k , .
2k<n, . ,
, , .
, On n1.
3--
.
-, -. - ,
-
, . , ,
On n>2 .
n 3 . , ,
. , On 2n1.
n- n1, 2n1 n ,
-. - n1
2n1 en:folded
cube graph .

On , (2n1)- X, x
X. On ,
x. x, ,
On. , On 2n1
. en:ErdsKoRado theorem ,
On. , On ,
, On 2n1
.
I , , x,
I , x.
G. n ,
n1 .
, , ,
283
,
, .

, On, n,
n+1, O3 n+1. n , ,
, n+1. O5, O6 O7
n .
:
- ( ) 1386
,
, . ?
O6, , 6
O6 .

O3 , , O4
O14 . ,
, On ( n = 4, 5, 6, 7) floor(n/2) .
n , . n=8, On
8 ,
.
en:Lovsz conjecture ,
On n4 .

[1] . .
284

,
() .

G = (V,E) M . : E M
M-, v V,
+(v) v , -(v) v.
. (e) 0 e E,
. M = Z k , -k <
(e) < k e, M- k-.
G = (V,E) . E k-,
v V.

G e,
(e) -(e). . ,
k-, . ,
M- k- . ,
G M- k- , - ( , ) G
.
, M k,
M- M, k, M. ,
M- k-.
en:Tutte 1953 .

G = (V,E) , , ,
() k {0, 1, 2, .., k 1}. : E(G) {-(k
1), , 1, 0, 1, , k 1} : e x y ,
(e) = x y. , k-. , ,
k-. , G G* G*
k-, G k-. ,
. , .
( ,
),
.
285
: 5-?
4-?
, , ,
( ). ,
Z- ( en:Robbins theorem), ,
k- k.
4- ( 4-
4-)[1] 6- ( 6-).[2]
en:Tutte , 5-[3]
, en:minor (graph theory)
4-.[4] , , 4-
, .

[1] F. Jaeger, Flows and generalized coloring theorems in graphs, J. Comb. Theory Set. B, 26 (1979), 205216.
[2] P. D. Seymour, Nowhere-zero 6-flows, J. Comb. Theory Ser B, 30 (1981), 130135.
[3] 5-flow conjecture (http:/ / garden. irmacs. sfu. ca/ ?q=op/ 5_flow_conjecture), Open Problem Garden.

Cun-Quan Zhang Integer Flows and Cycle Covers of Graphs. Marcel Dekker, Inc., 1997. (Chapman &
Hall/CRC Pure and Applied Mathematics Series). ISBN 9780824797904
T.R. Jensen and B. Toft, Graph Coloring Problems, Wiley-Interscience Serires in Discrete Mathematics and
Optimization, (1995)
286

,
. ,
,
. ,
( ,
).
, ,
, .
,
,
.
, NP- .
,
, , NP-.

: Brunch-and-Cut
Fishetti, Salazar-Gonzalez Toth[1],
, [2].

, ,
, (Nearest Neighbour),
,
. ,
.
, :
2-opt, ,
, ( 2-opt
). ,
, . ,
, , .
3-opt 2-opt, , . 3-opt,
.
,
. , .
2-opt 3-opt ,
.
287
Insertion 3-opt.
. .
, ,
.
Cluster Optimization , .

. , ,
. :
, , .
, Cluster Optimization ,
.

, .
Snyder Daskin[3],
Silberholz Golden[4] Gutin Karapetyan[5].

[1] M. Fischetti, J.J. Salazar-Gonzalez, and P. Toth. A Branch-and-Cut algorithm for the symmetric generalized traveling salesman problem.
Operations Research 45 (3) (1997), 378-394.
[2] D. Ben-Arieh, G. Gutin, M. Penn, A. Yeo, and A. Zverovitch. Transformations of generalized ATSP into ATSP, Operations Research Letters
31 (2003), 357-365.
[3] L.V. Snyder and M.S. Daskin. A random-key genetic algorithm for the generalized traveling salesman problem. European Journal of
Operational Research 174 (2006), 3853.
[4] J. Silberholz and B. Golden. The Generalized Traveling Salesman Problem: a new Genetic Algorithm approach. Extending the Horizons:
Advances in Computing, Optimization, and Decision Technologies, 2007, 165181.
[5] G. Gutin and D. Karapetyan. Gregory Gutin and Daniel Karapetyan. A Memetic Algorithm for the Generalized Traveling Salesman Problem.
Natural Computing 9(1), pages 47-60, Springer 2010. (http:/ / www. springerlink. com/ content/ 5v4568l492272865/ )
288

,

.
.
1950
1969 .

G(n,k) en:Drer graph G(6,2).
{u0, u1, ..., un1, v0, v1, ..., vn1}

{ui ui+1, ui vi, vi vi+k: i=0,...,n1}
n k < n/2. {n}+{n/k},
n- , .
en:voltage graph
, , .[1]
G(5,2) {5}+{5/2}.

n- G(n,1), en:Drer graph G(6,2),
G(8,3), G(10,2), G(10,3) en:Nauru graph G(12,5).
, 5- , , G(7,2)
, , 3- en:well-covered
graph ( , ).
289

.
,
1. G(n,k) - (,
, )
, n=10 k=2 k21 (modn).
2. - ( ,
)
: (n,k) = (4,1), (5,2), (8,3), (10,2), (10,3), (12,5),
(24,5).
.
3. , n
k . G(9,2).

4. ,
40.
k21 (modn).
5. en:hypohamiltonian graph n 5 6 k 2, n2,
(n+1)/2, (n1)/2 ( k ).
, n , 8, k n/2.
. n 3 6 k 2, G(n,k)
. G(n,2) ,
n , .
,
3 . G(9,2) ,
3 en:Uniquely colorable graph.[2]
/

[1] . 2.1.2, .58.
[2] . Reprint 1978 Academic Press.
( ) 290
( )
, .
( ), . ,
4- () 4. 4,
3. .

( )
- ( (3, )-). 5- (
5), 6-, 7-,
8-[1]. (-)
. , 10-, 70 10-
en:Balaban 10-cage, en:Harries graph en:Harries-Wong graph.
5 6 7
(8- )
8

. , 4,
, ,
.
en:probabilistic method.
. ,
.
. , ,
.
, .
. ,
, ,
.
( ) 291

.
, .
1-
en:systolic geometry.

[1] Distance-Regular Graphs (Brouwer, Cohen, Neumaier 1989, Springer-Verlag).

, ,
. ,
, .
, ,
:
, .

., . , , : . . .: , 1984. 455 .
. . .: , 1973.
: , , (http://rain.ifmo.ru/cat/view.php/
theory/list)
292

, .
, ,
- (
), .
. ,
, ,
.
.

. . .: , 1973.

: , , [1]
.) [2]

[1] http:/ / rain. ifmo. ru/ cat/ view. php/ theory
[2] https:/ / sourceforge. net/ projects/ igv-intelligent/
( ) 293
( )
en:vertex (graph
theory) v , v .
v G
G, , v
, . ,
6 7 . 5
1, 2, 4, 3 6.
5 1, 2, 4,
, 6 7
, 1 2.
NG(v) ( , ) N(v).
,
. , v
v. ,
v. NG[v]. ,
.

en:adjacency list .
en:clustering coefficient , .
,
.
. .
, .
, .

G ,
H, , G H,
G ,
F, , G
F (Hell 1978, Sedlacek 1983). , ,
, ,
,
C4.
:
Kn Kn-1.
,
.
4-.
en:Turn graph T(rs,r)
T((r-1)s,r-1). ,
.
en:Outerplanar graph. ,
.
( ) 294
, , .
k- (k-1)-. k-
(Wigderson 1983).
F ,
F F. , , c
, .
. ,
C4 , C5 ,
13 C6. , K4,
, ,
, (Hartsfeld & Ringel 1981; Larrin,
Neumann-Lara & Pizaa 2002; Malni & Mohar 1992).
(Seress & Szab 1995).
, o- . , ,
. ,
H, , H .
, , C5
C5 .

A , A ,
, A.
, A , A
A. ,
en:modular decomposition, .
,
en:comparability graph.

en:Vertex figure, .

Nora Hartsfeld, Gerhard RingelClean triangulations // Combinatorica. 1991. .2. .11.
.145155. DOI:10.1007/BF01206358 [1].
Pavol Hell Problems Combinatories et theorie des graphes. 1978. .260. .219223. (Colloque
internationaux C.N.R.S.)..
F. Larrin, V. Neumann-Lara, M. A. PizaaWhitney triangulations, local girth and iterated clique graphs //
Discrete Mathematics. 2002. .258. .123135. DOI:10.1016/S0012-365X(02)00266-2 [2].
Aleksander Malni, Bojan MoharGenerating locally cyclic triangulations of surfaces // Journal of Combinatorial
Theory, Series B. 1992. .2. .56. .147164. DOI:10.1016/0095-8956(92)90015-P [3].
Sedlacek Graph Theory, Lagw. Springer-Verlag, 1983. .1018. .242247. (Lecture Notes in
Mathematics). ISBN 978-3-540-12687-4 DOI:10.1007/BFb0071634 [4].
( ) 295
kos Seress, Tibor SzabDense graphs with cycle neighborhoods // Journal of Combinatorial Theory, Series
B. 1995. .2. .63. .281293. DOI:10.1006/jctb.1995.1020 [5].
WigdersonImproving the performance guarantee for approximate graph coloring // Journal of the ACM.
1983. .4. .30. .729735. DOI:10.1145/2157.2158 [6].

[2] http:/ / dx. doi. org/ 10. 1016%2FS0012-365X%2802%2900266-2
[3] http:/ / dx. doi. org/ 10. 1016%2F0095-8956%2892%2990015-P
[4] http:/ / dx. doi. org/ 10. 1007%2FBFb0071634
[5] http:/ / dx. doi. org/ 10. 1006%2Fjctb. 1995. 1020
[6] http:/ / dx. doi. org/ 10. 1145%2F2157. 2158

.
.
()
.

" " .
, , ,
, , ..

en:Graph minor
: k- Gk G ,
G k.
.
()
296
()
G1(V1, E1) G2(V2, E2):
- ,
() V1 V2 , , .
( en:Graph labeling).
, ,
( , ).
( )
en:Graph product :
en:Cartesian product of graphs
( ).
en:Lexicographic product of graphs
, .
en:Strong product of graphs
en:Tensor product of graphs,
, . (
)
-
[N] 1 N. -
k- , k i v v[i]
v, i. G1 - D1- [N1] G2
D2- [D1]. - H [N1] [D1],
n [N1], d [D1], i,j, [D2] (n, d) (n[d[i]], d[i][j]).
.
""
en:Rooted product of graphs. ,
.
en:Corona product of graphs G1 G2 (
en:Robert Frucht [1]) , G1
|V1| G2 (|V1| G1), G1
G2.
- en:Series-parallel graph:
. ( )
. .
( ). ( )
en:Hajs construction

[1] Robert Frucht and Frank Harary. "On the coronas of two graphs", Aequationes Math., 4:322324, 1970.
297

( ) () ,
.
,
.

, D=(V, E) E
.
(u, v) u v. , u
, v .
, , .
,
.
.

,
( ). .
, .
, .
.
,
.
, ;
, ,
; , ,
();
;
.
D D*, D,
D* , .
298

.
, ,
.

: , , , ,
(),
0 1 2 3 4 5 6
, , , CC CC , CC
, , CC, , CC
C, , , , ,
C, ,

.
, ,
.

.
,
. ,
, ,

.
299

. . .: , 2003. 300. ISBN 5-354-00301-6
, . .: , 2008. 352. ISBN 978-5-397-00044-4
. , . , , . : ,
, 2 = Compilers: Principles, Techniques, and Tools. 2 . .: , 2008.
ISBN 978-5-8459-1349-4

,
. ,
, , , ,
, , - .
, :
, , ;
,
.
, .
[1] ( ) .

.
:
,
.

,
. , , ,
, .
, , ,
, ()
.
.
STP.
(, ..),
, ,
.
,
, NP-.
300

[1] (http:/ / slovari. yandex. ru/ search. xml?text=& st_translate=sp)

,
.

G = (V,E), M G , ,
.
M G,
, ,
. , M G
, G M.
( ) .
( [1]) ,
.
. .
, .
.
( 1-en:1-factor) ,
. , ,
. (b) .
.
en:Edge cover . ,
.
,
. , .
(c) .
, , -en:Factor-critical
graph.
M.
,
.
( ) ,
( , ).
301
, ,
. ( en:Berge's lemma.)

en:edge covering
number . , |V| / 2.
A B , |A|2|B| |B|2|A|. , ,
B\A A\B A .
A\B B\A , B .
, , 2-
, 2- .
. , G 4 ,
1, 2.

k- .
G mk k- . G
n .
.

.
, ,
. ,
, .
, .
,
, . ,
. (.),
.
, , .
.
,
. ,
302
. .
.
, ,
.
.
,
.

, . en:Jack
Edmonds ,
en:Edmonds's matching algorithm. en:bidirected
graph.
en:maximum independent set .
, .
() , (Mucha, Sankowski),
, .

.
, , ,
.
, ,
.
, k en:edge
dominating set k . , k
, k .
,
.
NP- NP- [2].
2
M[3].

. #P-
. #P-
, 0-1 ( #P- )
, ,
. , ,
.
en:Pieter Kasteleyn, ,
FKTen:FKT algorithm.
Kn ( n) (n1)!!.
, ,
en:Telephone number (mathematics).
303
,
,
.
. , .

- ;
. ,
, .

,
. ,
, ,
.
( ) ,
, en:Tutte theorem .
1- , 1-. ,
k- k-.

, en:chemical structure.
, , (
6 ) [4].
.
.

[1] Alan Gibbons, Algorithmic Graph Theory, Cambridge University Press, 1985, Chapter 5.
[2] . , GT2
A1.1. GT10 A1.1.
[3] GT3 B ( 370).
GT10 B ( 374). Minimum Edge Dominating Set
(http:/ / www. nada. kth. se/ ~viggo/ wwwcompendium/ node13. html) Minimum Maximal Matching (http:/ / www. nada. kth. se/ ~viggo/
wwwcompendium/ node21. html) web compendium (http:/ / www. nada. kth. se/ ~viggo/ wwwcompendium/ ).
[4] , ,
304

1. Lszl Lovsz, Michael D. Plummer Matching Theory. North-Holland, 1986. ISBN 0-444-87916-1
2. Introduction to Algorithms. second. MIT Press and McGrawHill, 2001. ISBN 0-262-53196-8
1. S. J. Cyvin, Ivan Gutman Kekule Structures in Benzenoid Hydrocarbons. Springer-Verlag, 1988.
2. Marek Karpinski, Wojciech Rytter Fast Parallel Algorithms for Graph Matching Problems. Oxford University
Press, 1998. ISBN 978-0-19-850162-6

(http://e-maxx.ru/algo/kuhn_matching)
A graph library with Hopcroft-Karp and Push-Relabel-based maximum cardinality matching implementation
(http://lemon.cs.elte.hu/)

, ,
. ,
, .
, ,
:
, .

., . , , : . . .: , 1984. 455 .
. . .: , 1973.
: , , (http://rain.ifmo.ru/cat/view.php/
theory/list)
305

, .
: ,
. , ,
. , , .
, . ,
.

,
( ):
1736.[1] .
,
. , , , ,
.
. -,
. -, (
, ), ,
, . ,
, . ,
5.
:

306
. (5) .
. .
K5, 5

. .
,
, . .
. (3,3)
.

. 5 .
(K3,3)
: ( ) 4 .
, , F , E
. F=5 E=9 , .
-
: G
, K5
K3,3,
. ,
.

,
,

(K5)

(K3,3).
K5 K3,3 . ,

K5. , ,
( K3,3.
).
, , K5 K3,3.
307

, , 1974
.

K3,3 K5,
;
, 4 ,
3, 5 2.

. ,
, , . , ,
, , .
.
. , ,
.

[1] . . 126

(http://compscicenter.ru/program/lecture/6702)
. . . , (http://window.edu.ru/window_catalog/redir?id=20742&
file=9611_117.pdf) , 1996, No 11, . 117122.
. . . .: . 1973
: , , (http://rain.ifmo.ru/cat/
view.php/theory/list)
308

, .
, , .
.
()
|V| (|V|1), 1 ( )
0

.
,
, , ,
. , G ,
G .
-en:ErdsStone theorem , 1
0, 1/2, 2/3, 3/4, 4/5, ... n/(n+1), ... (, , .
7) .

(Streinu, 2008) (Theran, 2009) (k,l)-,
n knl , (k,l)-, (k,l)-
knl . (1,1)- ,
(1,1)- , en:arboricity k (k,k)- .
en:Pseudoforest (1,0)- , ,
en:rigidity theory (structural), (2,3)- .
. , ,
n 3n - 6 ,
, , (3,6)- .
(3,6)- . , en:outerplanar graph
(2,3)- (2,4)-.
, , (k,l)-,
.

(Ossona de Mendez, Neetil, 2010) , /
, .
, t,
t- . ,
, . /
(Ossona de Mendez, Neetil, 2012) .
309

Paul E. Black, Sparse graph (http://www.nist.gov/dads/HTML/sparsegraph.html), from Dictionary of
Algorithms and Data Structures, Paul E. Black (ed.), NIST. Retrieved on 29 September 2005.
Preiss, first (1998), Data Structures and Algorithms with Object-Oriented Design Patterns in C++, John Wiley
& Sons, ISBN 0-471-24134-2.
310
K7, 7
n

n! (Sn)
n
n n -
,
n 1
Kn
, .
. .
- ,
( ).
.
, , ,
-.

1 12 .
311
K1: 0 K2: 1 K3: 3 K4: 6
K5: 10 K6: 15 K7: 21 K8: 28
K9: 36 K10: 45 K11: 55 K12: 66

,

.

G := (V1 + V2, E) m = 5 n = 3 =
, = n + m = mn
v1 V1 v2 V2 (v1v2)
= 2 = max{m, n} =
G.
|V1|=m |V2|=n =
Km,n.
== =
=
312

k, K1,k
.
, ,
.
K1,3

- S3, S4, S5 S6.
.
K3,3
.
,

.

K3,3.
K3,3

, Km,n mn
NP- .
K3,3 en:Graph minor.
en:outerplanar graph K3,2 (
, ). ,
K3,3, K5 . en:Kuratowski's theorem.
Kn,n (n,4)-.
Kn,n Kn,n+1 en:Turn graph.
Km,n , min{m,n}
en:edge covering number, max{m,n}.
Km,n max{m,n}.
Km,n (nm), (nm) 0
1, 1 n+m2 .
Km,n n+m, n, m, 0
1, m1, n1 1 .
Km,n mn1 nm1 .
Km,n min{m,n}.
Kn,n n- ,
.
en:corollary , k-
.
313

John Adrian Bondy, U. S. R. MurtyGraph Theory with Applications. North-Holland, 1976. ISBN
0-444-19451-7., page 5.
Reinhard DiestelGraph Theory // 3rd. Springer, 2005. ISBN 3-540-26182-6.. Electronic edition [1], page
17.

[1] http:/ / www. math. uni-hamburg. de/ home/ diestel/ books/ graph. theory/

1. #

G , G.
, G,

G
G.

, ,
G. .
(
) .
G, .
.

en:tree-depth.[1] G
, ,
,
, G, G.
, ,
314
.
.

, ,
. , ,
.
, (Kautz 1958),
en:snake-in-the-box
.

.
, , ,
.
.
en:Cograph .
.
en:even-hole-free graph , ,
.
en:trivially perfect graph ,
, .

.
- en:distance-hereditary graph ,
,
.
en:block graph ,
, ,
.

, G k, NP- .
(Garey, Johnson 1979)
en:Mihalis Yannakakis.
, .
NP- ,
. ,
NP- .

.
( 5 ) n m
(n+m2).
315

. , n- n,
, n , .
n-, , .
O(m2), m
.

[1] , 6.4, . 122.

Francesco Barioli, Shaun Fallat, Leslie HogbenComputation of minimal rank and path cover number for certain
graphs // Linear Algebra Appl.. 2004. .392. .289303. DOI: 10.1016/j.laa.2004.06.019 (http://
dx.doi.org/10.1016/j.laa.2004.06.019)
Piotr Berman, Georg SchnitgerOn the complexity of approximating the independent set problem // Information
and Computation. 1992. .96. .7794. DOI: 10.1016/0890-5401(92)90056-L (http://dx.doi.org/
10.1016/0890-5401(92)90056-L)
Fred Buckley, Frank HararyOn longest induced paths in graphs // Chinese Quart. J. Math.. 1988. .3.
.6165.
Gary Chartrand, Joseph McCanna, Naveed Sherwani, Moazzem Hossain, Jahangir HashmiThe induced path
number of bipartite graphs // Ars Combin.. 1994. .37. .191208.
Michael R. Garey, David S. Johnson Computers and Intractability: A Guide to the Theory of
NP-Completeness.. W. H. Freeman, 1979. .196.
Michael Gashler, Tony MartinezRobust manifold learning with CycleCut // Connection Science. 2012.
.1. .24. .5769. DOI: 10.1080/09540091.2012.664122 (http://dx.doi.org/10.1080/09540091.
2012.664122)
Fnic GavrilAlgorithms for maximum weight induced paths // Information Processing Letters. 2002.
.4. .81. .203208. DOI: 10.1016/S0020-0190(01)00222-8 (http://dx.doi.org/10.1016/
S0020-0190(01)00222-8)
Johan Hstad Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science.
1996. .627636. DOI: 10.1109/SFCS.1996.548522 (http://dx.doi.org/10.1109/SFCS.1996.548522)
W. H. KautzUnit-distance error-checking codes // IRE Trans. Elect. Comput.. 1958. .7. .177180.
Dieter Kratsch, Haiko Mller, Ioan Todinca Graph-theoretic concepts in computer science. Berlin: Lecture
Notes in Computer Science, Vol. 2880, Springer-Verlag, 2003. .309321. DOI: 10.1007/b93953 (http://
dx.doi.org/10.1007/b93953)
Hong-Oanh Le, Van Bang Le, Haiko MllerSplitting a graph into disjoint induced paths or cycles // Discrete
Appl. Math.. 2003. .1. .131. .199212. DOI: 10.1016/S0166-218X(02)00425-0 (http://dx.
doi.org/10.1016/S0166-218X(02)00425-0)
Jaroslav Neetil, Patrice Ossona de Mendez Sparsity: Graphs, Structures, and Algorithms. Heidelberg:
Springer, 2012. .28. .115144. (Algorithms and Combinatorics). ISBN 978-3-642-27874-7
DOI: 10.1007/978-3-642-27875-4 (http://dx.doi.org/10.1007/978-3-642-27875-4)
Stavros D. Nikolopoulos, Leonidas Palios Proc. 15th ACM-SIAM Symposium on Discrete Algorithms.
2004. .850859..
316

,
, .
. .
f(u, v), :
: . .
: . .
:
.

.
,
.
.

, .
,
. , .
- .
,
.
-.
: ,
, - .
- .
317

[1]
Java [2]

, ., , ., , ., , . : = Introduction to
Algorithms / . . . . 2- . .: , 2005. 1296. ISBN 5-8459-0857-4

[1] http:/ / rain. ifmo. ru/ cat/ view. php/ vis/ graph-flow-match/ min-cost-max-flow-2009
[2] http:/ / sites. google. com/ site/ indy256/ algo/ min_cost_flow

.
:
rrep(T)
, :
) ,
,, , rrep(T)=(rrep( )rrep( )rrep( ))A
) ,
, rrep(T)=A
, : (((4 5)3 6)2 7 ((10 11)9 12)8)1
318

(
) :

( );
( );
, , ;
, ;
;
.
, .

. , (
) :
,
,
,
.
, , .

,
, , ,
, ,
( ) ;
.
, , .
(.register allocation)
.
(.IL, intermediate language, internal
language),
.

, , , ,
.
(.spill code), (spilling). ,
( ,
).
, Intel,
:
319
IA-32 8 .,
Intel 64 16 .
(, ,
.)
.
, :
.
, , .
,
.
:
(.interfernce graph, conflict graph).
. ,
(-: , ).
(subsumption, variable propagation):
, 2- , 1-
() .
, , : n- , n -
.
. :
1. n , .
2. ( n, )
; . ,
1. ( ,
.)
, .
, :
GCC 4.4 .integrated register allocator,
.. -.
- ( , ) Intel
IA-64.

, ,
; , (.Instruction-level
parallelism, ILP). ILP-. ILP-
- VLIW (Very Large Instruction Word, ,
, ().

Itanium Intel. E2K,
.
ILP-
, ; ,
. ILP
; .
320

..
.cache line coloring.
: (, , ),
, . , ..
(first-generation cache conflicts)
/. ,
, , , , ,
.
, , , ,
. inline-.
, ,
.

(.Spectrum management, .frequency allocation)
, , .
,
. :
(, ) ,
.
, , (.point-to-point)
, - .
, .
, .
,
, .
:

();
.
, T-
(.T-coloring) , T- (.set T-coloring).
,
( E-Plus((.) en:E-Plus) 3-
( 2010)).
321

: ,
(, ), . -
, - . ,
.
, :

() , , , .

.
, , , , :
, ,
; , ,
, .
, .. (.iterative smoother)
. (.multigrid methods of finite element problems).
, , .. .sparse tiling
.

(.Adaptive mesh refinement)
, , ().
: ,
, .

(.Method of coordinate relaxation)

. , , .
.
LU-
(Preconditioning by ILU, Incomplete LU-factorization)
.

( ) , ,
. Graph Coloring for Computer
Derivatives, . , ,
. ,
, , .
322
, ,
:
:
:
1. ( ).
2. .seed matrix; ,
.
3. ; ,
. ,
4. , ( ,
).
.
(.distance-1); distance-2 (, distance-1 square graph);
, :
(star coloring) distance-1, :
4- 3- ;
(acyclic coloring) distance-1 + 3-
.
:
( , )
.Simulated Moving Bed;
(optimal power flow) ().

(.digital watermarking) (
, ) ( , Watermark).

.
, , .
, (system-on-chip).
. Qu Potkonjak
( QP-) .
: , G, ,
,
. ,
, , ,
.
;
,
, , .
Qu Potkonjak, , , .
, , SandMark, ;
.
323

: ; . ,
, , , 4- , 4.
-7 ( ); ,
. ,
, , -7
.
( .. ;
/ ).
: 9 9 . .
, :
, ,
, ,
.
, , ,
.

-
, 2010 .

(
) :

( );
( );
, , ;
, ;
;
.
, .
324

. , (
) :
,
,
,
.
, , .

,
, , ,
, ,
( ) ;
.
, , .
(.register allocation)
.
(.IL, intermediate language, internal
language),
.

, , , ,
.
(.spill code), (spilling). ,
( ,
).
, Intel,
:
IA-32 8 .,
Intel 64 16 .
(, ,
.)
.
, :
.
, , .
,
.
:
(.interfernce graph, conflict graph).
. ,
(-: , ).
325
(subsumption, variable propagation):

, 2- , 1-
() .
, , : n- , n -
.
. :
1. n , .
2. ( n, )
; . ,
1. ( ,
.)
, .
, :
GCC 4.4 .integrated register allocator,
.. -.
- ( , ) Intel
IA-64.

, ,
; , (.Instruction-level
parallelism, ILP). ILP-. ILP-
- VLIW (Very Large Instruction Word, ,
, ().

Itanium Intel. E2K,
.
ILP-
, ; ,
. ILP
; .

..
.cache line coloring.
: (, , ),
, . , ..
(first-generation cache conflicts)
/. ,
, , , , ,
.
, , , ,
. inline-.
, ,
.
326

(.Spectrum management, .frequency allocation)
, , .
,
. :
(, ) ,
.
, , (.point-to-point)
, - .
, .
, .
,
, .
:

();
.
, T-
(.T-coloring) , T- (.set T-coloring).
,
( E-Plus((.) en:E-Plus) 3-
( 2010)).

: ,
(, ), . -
, - . ,
.
, :

() , , , .

.
, , , , :
, ,
; , ,
, .
, .. (.iterative smoother)
. (.multigrid methods of finite element problems).
, , .. .sparse tiling
.
327

(.Adaptive mesh refinement)
, , ().
: ,
, .

(.Method of coordinate relaxation)

. , , .
.
LU-
(Preconditioning by ILU, Incomplete LU-factorization)
.

( ) , ,
. Graph Coloring for Computer
Derivatives, . , ,
. ,
, , .
, ,
:
:
:
1. ( ).
2. .seed matrix; ,
.
3. ; ,
. ,
4. , ( ,
).
.
(.distance-1); distance-2 (, distance-1 square graph);
, :
(star coloring) distance-1, :
4- 3- ;
(acyclic coloring) distance-1 + 3-
.
:
( , )
.Simulated Moving Bed;
(optimal power flow) ().
328

(.digital watermarking) (
, ) ( , Watermark).

.
, , .
, (system-on-chip).
. Qu Potkonjak
( QP-) .
: , G, ,
,
. ,
, , ,
.
;
,
, , .
Qu Potkonjak, , , .
, , SandMark, ;
.

: ; . ,
, , , 4- , 4.
-7 ( ); ,
. ,
, , -7
.
( .. ;
/ ).
: 9 9 . .
, :
, ,
, ,
.
, , ,
.
329

-
, 2010 .

(.Knigsberger
Brckenproblem) , ,
, . 1736
.

: (
), .
, , . ,
.
1736 ,
, 13
1736 . , , ,
, , . .

() ( ),
( ). :
(, ) .
, .
, , , ,
.
.
() ( ), ,
, .

330
.
.

(, ,
).

1905 ,
. ,
, ,
, ( ,
). 2005 .
, , ,
- .[1]

[2]

[1] THE BRIDGES OF KNIGSBERG - A HISTORICAL PERSPECTIVE by Irina Gribkovskaia, yvind Halskau sr and Gilbert Laporte
(http:/ / kursinfo. himolde. no/ lo-kurs/ lo904/ Laporte/ BridgesPaper. pdf)
[2] http:/ / math. dartmouth. edu/ ~euler/ docs/ originals/ E053. pdf
331

1. #

15 ,
1878 .
,
.
15
( 8 ),

. ,
,
.

1891 ,
[1]. ,
[2].
,
(.), 1874
,
,
,
34.
, ,
( -),

(),
(.) . 1879
, .
. 1879
(.Gem Puzzle).
1880 , , ,
,
. .
21 1880
Block Solitaire Puzzle[3], ,
, Puzzle-Blocks.
332

.

.
IDA*.
,
20922789888000 (=16!)
:
(
) .
, - ,
, . ,

( 1).
, .
( , 15, )
NP-.
90 , ,
( ). ,
,
.

[1] Cyclopedia of Puzzles, p. 235 (http:/ / www. mathpuzzle. com/ loyd/ cop234-235. jpg)
[2] Barry R. Clarke, Puzzles for Pleasure, pp.10-12, Cambridge University Press, 1994 ISBN 0-521-46634-2.
[3] Block Solitaire Puzzle (solitaire , , )

Optimal 8/15-Puzzle Solver (http://www.brian-borowski.com/Software/Puzzle/) - Java source
"15puzzle Optimal solver" for windows (http://www.ic-net.or.jp/home/takaken/e/15pz/) - Ken'ichiro
Takahashi (takaken)
Fifteen Puzzle Optimal Solver (http://kociemba.org/fifteen/fifteensolver.html) - Herbert Kociemba`s
Homepage
333

(.Graph partition) (
[1])

. ,
,
, .

: ,
.
,
(
-
) , ,
.
( ). , ,
NP-,
,

( ), .
1520
( ),
, .
:
1. ,
.
, NP ( ).
2. .
3.
(
( ,
DHCP, WINS, DNS ..), ,
, ).
4.
( ).
(, ),

. [2]
5. -
. ,
,
, ;
. [3][4][5][6]
6. - -
( ).
334
7.

( ). [7][8]
[9]

( , )
(.)

[1] .. . .: , 1985. 352 .
[2] . ., . ., .. . .: , 1990.
216 .
[3] . ., . ., .. -
- // . 1984. 5. . 7481.
[4] . ., . ., . . [ .] . : -
, 1999. 368 . ISBN 5-7277-0253-4
[5] . ., . ., . . [ .] -
. , - , 2010. 200 . ISBN
978-5-7681-0523-5
[6] .. . - . Saarbrucken:
Lambert Academic Publishing, 2011 . 292 . ISBN 978-3-8433-1728-3
[7] . ., . ., . ., .. :
2- . /: - , 2009. 344 . ISBN 978-5-902982-61-6
[8] . ., ..
// 5-
(PACO10). .: , 2010. . 2337.
[9] INTUIT.ru: : ..: 10: (http:/ / www. intuit. ru/ department/ calculate/
paralltp/ class/ free/ 10/ 5. html)
335

,
.
. ()
, ,
.
, -
, .
, -
.

...

(S,T),
1. ,
2.
3. , , .
, .
()
, ,
, , .
, .

.
,
.
336

,
,

.

, , .
,
, , u, v w
.
m(u,v,w) (
),
.[1] ,
en:partial cube ,
.

,
:
,

en:forbidden graph
characterization.
(-en:simplex graph K3),
K1,3 (- ) ,
, .
.
, ( r
, r, ,
v v (, v
4, v) ,
.
en:arrangement of lines
en:Hyperbolic space, .
337

(. )
,

.
,
. , , , (Chepoi, Dragan, Vaxs
2002; Chepoi, Fanciullini, Vaxs 2004)
,
( ,
).

[1] . .

H.-J. Bandelt, V. Chepoi, D. EppsteinCombinatorics and geometry of finite and infinite squaregraphs // SIAM
Journal on Discrete Mathematics. 2010. .4. .24. .13991440. DOI: 10.1137/090760301
(http://dx.doi.org/10.1137/090760301) ariv:0905.4537.
V. Chepoi, F. Dragan, Y. VaxsProc. 13th Annu. ACMSIAM Symp. on Discrete Algorithms (SODA 2002).
2002. .346355..
V. Chepoi, C. Fanciullini, Y. VaxsMedian problem in some plane triangulations and quadrangulations //
Comput. Geom.. 2004. .3. .27. .193210. DOI: 10.1016/j.comgeo.2003.11.002 (http://dx.
doi.org/10.1016/j.comgeo.2003.11.002).
I. PeterinA characterization of planar median graphs // Discussiones Mathematicae Graph Theory. 2006.
.26. .4148..
.., .., ..
. Chiinu, Moldova: , 1973..

338

,
.
;
. ,
,
,
. ,
, .
,
, , ,
, .

, - .

. , - ,
. ,
. ,
, - ,
(, ).

. .
, .
.
, ,
, , .
,
. , ,
. , ,
. .

.
, , ,
, , .
, ,
1852 .
1879. , , ,
, .

.
1890 , , , . ,
, , ,
. .
.
339
1976 .
.
,
.
1912
, ,
. 1979 , .

20 .
1960 ,
, - ,
, .
40 ,
, , 2002 .
1970- :
21 NP- 1972 .

,
,
, ,
, . , ,
,
.
, ,
.
,
, {1,2,3,...}. 3
12 .
k k-.
, G
(G). (G),
(G) . , ,
, . , k- -
, k .
340

. ,
12
3 .
. 4 , 24+4*12 = 72
: 4 , 4! = 24
( 4 4
); 3 4 12
. , ,
:
3

. E3
()
, - .

3 12 .
1 2 3 4
0 0 12 72
- P(G,t), t- G. ,
G - , t. , P(G,t)=t(t1)2(t2),
,P(G,4)=72.
G,
. , - ,
.
341

K3
Kn
Cn

,
.
. , G -
, , (G).

- .
, , , , ,
. (G) G - ,
.
, - .
, n .
m ,
G k, k ,
, :
.
2- - , . 4 ,
4 .
, ,
,
, - ,
, , ;
,
: , G, G
-.
342

, .
- 4- ,
.
:
.
,
. , - -
. :
, , 2:
: .

G - , . ,
,
: , G - .
, , :
:
.

k- , ,
k. ---.
, - .
.
.
G k-, G
k-, . - .
n- n n0,
.

, ,
, . 4, 5, 6, 7.
, ,
k k , , ,
, ,
, k- ,
.
,
, G, .
, , ,
. ,
343
, , .

. ,
, .
, ,
, , , .
.
- .
. ,
, ,
. ,
, 3 .

- .
, ,
,
. ,
, .
.
, , ,
. k-, k
.

,
.
9
81 .

Barenboim, L. & Elkin, M. (2009), "Distributed (+1)-coloring in linear (in ) time" (http://dx.doi.org/10.
1145/1536414.1536432), Proceedings of the 41st Symposium on Theory of Computing, . 111120, ISBN
978-1-60558-506-2, DOI 10.1145/1536414.1536432
Panconesi, A. & Srinivasan, A. (1996), "On the complexity of distributed network decomposition", Journal of
Algorithms, vol. 20
Schneider, J. (2010), "A new technique for distributed symmetry breaking" (http://www.dcg.ethz.ch/
publications/podcfp107_schneider_188.pdf), Proceedings of the Symposium on Principles of Distributed
Computing
344
Schneider, J. (2008), "A log-star distributed maximal independent set algorithm for growth-bounded graphs"
(http://www.dcg.ethz.ch/publications/podc08SW.pdf), Proceedings of the Symposium on Principles of
Distributed Computing
Beigel, R. & Eppstein, D. (2005), " 3-coloring in time O(1.3289n) (http://dx.doi.org/10.1016/j.jalgor.2004.
06.008)", Journal of Algorithms .54(2)): 168204, DOI 10.1016/j.jalgor.2004.06.008
Bjrklund, A.; Husfeldt, T. & Koivisto, M. (2009), " Set partitioning via inclusionexclusion (http://dx.doi.
org/10.1137/070683933)", SIAM Journal on Computing .39(2): 546563, DOI 10.1137/070683933
Brlaz, D. (1979), " New methods to color the vertices of a graph (http://dx.doi.org/10.1145/359094.
359101)", Communications of the ACM .22(4): 251256, DOI 10.1145/359094.359101
Brooks, R. L. & Tutte, W. T. (1941), " On colouring the nodes of a network (http://dx.doi.org/10.1017/
S030500410002168X)", Proceedings of the Cambridge Philosophical Society .37(2): 194197, DOI
10.1017/S030500410002168X
N. G. de Bruijn, P. ErdsA colour problem for infinite graphs and a problem in the theory of relations // Nederl.
Akad. Wetensch. Proc. Ser. A. 1951. .54. .371373. (= Indag. Math. 13)
Byskov, J.M. (2004), " Enumerating maximal independent sets with applications to graph colouring (http://dx.
doi.org/10.1016/j.orl.2004.03.002)", Operations Research Letters .32(6): 547556, DOI
10.1016/j.orl.2004.03.002
G. J. Chaitin Proc. 1982 SIGPLAN Symposium on Compiler Construction. 1982. .98105. ISBN
0-89791-074-5 DOI: 10.1145/800230.806984 (http://dx.doi.org/10.1145/800230.806984)
Cole, R. & Vishkin, U. (1986), " Deterministic coin tossing with applications to optimal parallel list ranking
(http://dx.doi.org/10.1016/S0019-9958(86)80023-7)", Information and Control .70(1): 3253, DOI
10.1016/S0019-9958(86)80023-7
Cormen, T. H.; Leiserson, C. E. & Rivest, R. L. (1990), Introduction to Algorithms (1st ed.), The MIT Press
Dailey, D. P. (1980), " Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete
(http://dx.doi.org/10.1016/0012-365X(80)90236-8)", Discrete Mathematics .30(3): 289293, DOI
10.1016/0012-365X(80)90236-8
Duffy, K.; O'Connell, N. & Sapozhnikov, A. (2008), " Complexity analysis of a decentralised graph colouring
algorithm (http://www.hamilton.ie/ken_duffy/Downloads/cfl.pdf)", Information Processing Letters
.107(2): 6063, doi: 10.1016/j.ipl.2008.01.002 (http://dx.doi.org/10.1016/j.ipl.2008.01.002)
Fawcett, B. W. (1978), "On infinite full colourings of graphs", Can. J. Math. .XXX: 455457
Fomin, F.V.; Gaspers, S. & Saurabh, S. (2007), "Improved Exact Algorithms for Counting 3- and 4-Colorings"
(http://dx.doi.org/10.1007/978-3-540-73545-8_9), Proc. 13th Annual International Conference, COCOON
2007, vol. 4598, Lecture Notes in Computer Science, Springer, . 65-74, ISBN 978-3-540-73544-1, DOI
10.1007/978-3-540-73545-8_9
Garey, M. R. & Johnson, D. S. (1979), Computers and Intractability: A Guide to the Theory of
NP-Completeness, W.H. Freeman, ISBN 0-7167-1045-5
Garey, M. R.; Johnson, D. S. & Stockmeyer, L. (1974), "Some simplified NP-complete problems" (http://portal.
acm.org/citation.cfm?id=803884), Proceedings of the Sixth Annual ACM Symposium on Theory of
Computing, . 4763, doi: 10.1145/800119.803884 (http://dx.doi.org/10.1145/800119.803884)
Goldberg, L. A. & Jerrum, M. (July 2008), " Inapproximability of the Tutte polynomial (http://dx.doi.org/10.
1016/j.ic.2008.04.003)", Information and Computation .206(7): 908929, DOI 10.1016/j.ic.2008.04.003
Goldberg, A. V.; Plotkin, S. A. & Shannon, G. E. (1988), " Parallel symmetry-breaking in sparse graphs (http:/
/dx.doi.org/10.1137/0401044)", SIAM Journal on Discrete Mathematics .1(4): 434446, DOI
10.1137/0401044
Guruswami, V. & Khanna, S. (2000), "On the hardness of 4-coloring a 3-colorable graph" (http://dx.doi.org/
10.1109/CCC.2000.856749), Proceedings of the 15th Annual IEEE Conference on Computational
Complexity, . 188197, ISBN 0-7695-0674-7, DOI 10.1109/CCC.2000.856749
345
Halldrsson, M. M. (1993), " A still better performance guarantee for approximate graph coloring (http://dx.
doi.org/10.1016/0020-0190(93)90246-6)", Information Processing Letters .45: 1923, DOI
10.1016/0020-0190(93)90246-6
Holyer, I. (1981), " The NP-completeness of edge-coloring (http://dx.doi.org/10.1137/0210055)", SIAM
Journal on Computing .10(4): 718720, DOI 10.1137/0210055
Crescenzi, P. & Kann, V. (December 1998), " How to find the best approximation results a follow-up to
Garey and Johnson (http://dx.doi.org/10.1145/306198.306210)", ACM SIGACT News .29(4): 90, DOI
10.1145/306198.306210
Jaeger, F.; Vertigan, D. L. & Welsh, D. J. A. (1990), " On the computational complexity of the Jones and Tutte
polynomials (http://dx.doi.org/10.1017/S0305004100068936)", Mathematical Proceedings of the
Cambridge Philosophical Society .108: 3553, DOI 10.1017/S0305004100068936
Jensen, T. R. & Toft, B. (1995), Graph Coloring Problems, Wiley-Interscience, New York, ISBN
0-471-02865-7
Khot, S. (2001), "Improved inapproximability results for MaxClique, chromatic number and approximate graph
coloring" (http://dx.doi.org/10.1109/SFCS.2001.959936), Proc. 42nd Annual Symposium on Foundations
of Computer Science, . 600609, ISBN 0-7695-1116-3, DOI 10.1109/SFCS.2001.959936
Kubale, M. (2004), Graph Colorings, American Mathematical Society, ISBN 0-8218-3458-4
Kuhn, F. (2009), "Weak graph colorings: distributed algorithms and applications" (http://dx.doi.org/10.1145/
1583991.1584032), Proceedings of the 21st Symposium on Parallelism in Algorithms and Architectures, .
138144, ISBN 978-1-60558-606-9, DOI 10.1145/1583991.1584032
Lawler, E.L. (1976), " A note on the complexity of the chromatic number problem (http://dx.doi.org/10.
1016/0020-0190(76)90065-X)", Information Processing Letters .5(3): 6667, DOI
10.1016/0020-0190(76)90065-X
Leith, D.J. & Clifford, P. (2006), "A Self-Managed Distributed Channel Selection Algorithm for WLAN" (http://
www.hamilton.ie/peterc/downloads/rawnet06.pdf), Proc. RAWNET 2006, Boston, MA
Linial, N. (1992), " Locality in distributed graph algorithms (http://dx.doi.org/10.1137/0221015)", SIAM
Journal on Computing .21(1): 193201, DOI 10.1137/0221015
van Lint, J. H. & Wilson, R. M. (2001), A Course in Combinatorics (2nd ed.), Cambridge University Press,
ISBN 0-521-80340-3.
Marx, Dniel (2004), "Graph colouring problems and their applications in scheduling", Periodica Polytechnica,
Electrical Engineering, vol. 48, . 1116, :Citeseerx
Mycielski, J. (1955), " Sur le coloriage des graphes (http://matwbn.icm.edu.pl/ksiazki/cm/cm3/cm3119.
pdf)", Colloq. Math. .3: 161162.
Neetil, Jaroslav & Ossona de Mendez, Patrice (2012), "Theorem 3.13" (http://dx.doi.org/10.1007/
978-3-642-27875-4), Sparsity: Graphs, Structures, and Algorithms, vol. 28, Algorithms and Combinatorics,
Heidelberg: Springer, . 42, ISBN 978-3-642-27874-7, DOI 10.1007/978-3-642-27875-4.
Panconesi, Alessandro & Rizzi, Romeo (2001), " Some simple distributed algorithms for sparse networks
(http://dx.doi.org/10.1007/PL00008932)", Distributed Computing (Berlin, New York: Springer-Verlag) .
.14(2): 97100, ISSN 0178-2770 (http://worldcat.org/issn/0178-2770), DOI 10.1007/PL00008932
Sekine, K.; Imai, H. & Tani, S. (1995), "Computing the Tutte polynomial of a graph of moderate size" (http://dx.
doi.org/10.1007/BFb0015427), Proc. 6th International Symposium on Algorithms and Computation (ISAAC
1995), vol. 1004, Lecture Notes in Computer Science, Springer, . 224233, ISBN 3-540-60573-8, DOI
10.1007/BFb0015427
Welsh, D. J. A. & Powell, M. B. (1967), " An upper bound for the chromatic number of a graph and its
application to timetabling problems (http://dx.doi.org/10.1093/comjnl/10.1.85)", The Computer Journal
.10(1): 8586, DOI 10.1093/comjnl/10.1.85
West, D. B. (1996), Introduction to Graph Theory, Prentice-Hall, ISBN 0-13-227828-6
346
Wilf, H. S. (1986), Algorithms and Complexity, PrenticeHall

Zuckerman, D. (2007), " Linear degree extractors and the inapproximability of Max Clique and Chromatic
Number (http://dx.doi.org/10.4086/toc.2007.v003a006)", Theory of Computing .3: 103128, DOI
10.4086/toc.2007.v003a006
Zykov, A. A. (1949), " (On some properties of linear
complexes) (http://mi.mathnet.ru/eng/msb5974)", Math. Sbornik. .24(66)(2): 163188
Jensen, Tommy R. & Toft, Bjarne (1995), Graph Coloring Problems, John Wiley & Sons, ISBN
9780471028659
( )

( ).
. , .
, ,
.

[1]
, . ,
,
, .

,
. ( )
, .

. , .
, , ,
.
. ,
, , , .
, .
.
, .
, , , , , .
,
. , . ,
, .
,
, . , u
, v .

en:level structure .
( ) 347

. , .
.
, :
1. .
2. , , .
3. , 2,
.

en:Resistance distance
en:Betweenness
en:Betweenness
en:Betweenness
en:degree diameter

[1] F. Harary, Graph Theory, Addison-Wesley, 1969, p.199.

,
.
(Fldes, Hammer
1977a, Fldes, Hammer 1977b),
(, 1979).[1]

. ,
abc
,
:
.
1. {a,b} {c}
2. {b,c} {a}
3. {b} {a,c}
en:forbidden induced
subgraph ,
, ( 4
).[2]
348

, .[3]
, ,
.[4]
, .[5]
. , n ,
n .
, .
, ,
( , 2 ,
),
,
en:Strong Perfect Graph Theorem (Chudnovsky, Robertson, Seymour, Thomas 2006).
, , ,
en:comparability graph, . , ,
.[6]
en:cograph en:threshold graph,
en:permutation graph ,
.[7] en:cocoloring 2.

G , C I.
C, I.
, , ,
.
:[8]
1. x I, C {x} . , C {x}
I .
2. x C, I {x} . I {x}
C .
3. C I . G
(C,I) , C , I
.
, NP- ,
, .
349

,
. d1 d2 ... dn
G m i, di i - 1. G
,
, m G,
.[9]

(Royle 2000) , n
en:Sperner families. ()
n . n, n = 1,
1, 2, 4, 9, 21, 56, 164, 557, 2223, 10766, 64956, 501696, ... A048194 OEIS.
en:graph enumeration (Tyshkevich, Chernyak 1990).

[1] , , ,
( , , ) ( , ,
). ,
, , C (, 3.2.3, .41.)
[2] ; , 6.3, . 151.
[3] , 6.1, . 150.
[4] ; , 6.3, . 151; , 3.2.3, p. 41.
[5] ; ; , 4.4.2, . 52.
[6] ; , 9.7, . 212.
[7] , 7.1.1 . 106 7.1.2 . 107.
[8] ; , 6.2, . 150.
[9] ; ; ; , 6.7 6.8, . 154; , 13.3.2, . 203.
.

E. A. Bender, L. B. Richmond, N. C. WormaldAlmost all chordal graphs split // J. Austral. Math. Soc..
1985. .2. .38. .214221. DOI: 10.1017/S1446788700023077 (http://dx.doi.org/10.1017/
S1446788700023077).
Andreas Brandstdt, Van Bang Le, Jeremy SpinradGraph Classes: A Survey. SIAM Monographs on Discrete
Mathematics and Applications, 1999. ISBN 0-89871-432-X..
Maria Chudnovsky, Neil Robertson, Paul Seymour, Robin ThomasThe strong perfect graph theorem // Annals of
Mathematics. 2006. .1. .164. .51229. DOI: 10.4007/annals.2006.164.51 (http://dx.doi.
org/10.4007/annals.2006.164.51).
Stphane Fldes, Peter L. Hammer Congressus Numerantium. Winnipeg: Utilitas Math., 1977a. .XIX.
.311315..
Stphane Fldes, Peter L. HammerSplit graphs having Dilworth number two // Canadian Journal of
Mathematics. 1977b. .3. Vol.29. .666672. DOI: 10.4153/CJM-1977-069-1 (http://dx.doi.
org/10.4153/CJM-1977-069-1).
350
0-12-289260-7.
Peter L. Hammer, Bruno SimeoneThe splittance of a graph // Combinatorica. 1981. .3. .1.
.275284. DOI: 10.1007/BF02579333 (http://dx.doi.org/10.1007/BF02579333).
F. R. McMorris, D. R. ShierRepresenting chordal graphs on K1,n // Commentationes Mathematicae Universitatis
Carolinae. 1983. .24. .489494..
Russell MerrisSplit graphs // European Journal of Combinatorics. 2003. .4. .24. .413430.
DOI: 10.1016/S0195-6698(03)00030-1 (http://dx.doi.org/10.1016/S0195-6698(03)00030-1).
Gordon F. RoyleCounting set covers and split graphs // Journal of Integer Sequences. 2000. .2.
.3. .00.2.6..
. // . 1980.
.8. .24. .677679.
. . , .. , //
, . .-. . 1979. .5. .1426..
. . , .. .
1990. .6. .48. .98105..
. . , .. , .. :
// . 1981. .6. .58..
H.-J. VossNote on a paper of McMorris and Shier // Commentationes Mathematicae Universitatis Carolinae.
1985. .26. .319322..

(Martin Charles
Golumbic) "Algorithmic Graph Theory and Perfect Graphs".

351

,
. ,
,
.
.
,

.

. ,

, ,
3- .
.
, ,
, . ,
, ,
. ,
. ,
, NP-
. ,
, .
.
352

-
. .[1]

, .
en:Baranyai's theorem. [2]
:
-.
,
,
, . ,
,
, -
.[3]

,
7 .
- , ,
,
( , ,
.
). ,
.
[4]
, ( ) , ,
, . ,
6- 6- . 3, 4 8,
, 5, 6 7 .[5]

, , ,
, . ,
.
, ,
.
() -.
() -, , -.
, ()
, .
. ,
. -, .
,
, .
, , ,
(,
).

.
353

,
.
,
,
.
, . ,
,
.
,

. , 3- 16
24 , 7
,
. ,
,
.
.[6] , 16
, .
,
4, 5, 5.
. , ,
. , , 24/7,
, .
, ,
, , . ,
. , , ,
, .
, , ,
k-. ,
, 3-.

(
, ). , ,
, ,
. (
en:Vadim G. Vizing, 1964) ,
, , . ,
, G 1, [7] 2.
1 1.[8] ,
, 1, NP- .
1965 , 1
, . ,
, .
354
. [9]. , 1,
.[10]

1-en:1- factorization k- ,
, k- . ,
1- , 1. , 3-
(3-) .
1-. , .
, , , , 3- 2.
[7] 1-.
en:Configuration (geometry)
.

,
, ,

, ,
(
).
, ,
, ,
,
. ,
(
,
)
(
,
). , ,
[11] [12] , .
, .
( ).

, 1, NP-,
, .
, : ,
, .

. , (, , 2001) ,
, .
, (,
355
1982) ( 2003). ,
,
, . ,
, ,
, . , ( 1976),

, ,
. .

. , ,
(, 2008).
, ,
(, 1992) ( . 1985)
, , .
(, 1987) ,
en:Eli Upfal.
, ,
. ,
, , ,
.
. ,
, , ,
.
, (, ,
2001). , , , ,
, .
.
(
, ).
, , ,
.
( ).
,
, .
, .
en:greedy coloring,
, ,
. ,
en:online algorithm, .
en:Competitive analysis (online algorithm) ,
. ,
,
.[13].
356
, (,
)
.[14] , ,
,
. , , ,
,
.[15]

, ,
, .
( 2009), , ,
.
, ,
. 3-
3-. (
). en:Greg Kuperberg, -,
[16]
, , .
,
, ,
,
(, , 2009).
NP- ,
en:Parameterized complexity .
. , , (, ,
1996) ,
, ,
.
(, 1991)

. -
.
357

en:Uniquely colorable graph
- ,
,
.
- ,
,
- .
3-
( ),
3- ,
, 3-, ,
, 3-
. .

3- ,
[17] ,
, , . 40

.
(, 1969)
,

, , .
,
,
, . ,
, ,

, ( ), . K3,3
,
, , .
en:Kempe chain,
, . ,
en:equitable coloring ,
, .
-en:De BruijnErdos theorem (graph theory)
. ,

.[18]
( 2011) ,
.
, ,
. ,
3- .
, 3-
358
, k- en:k-edge-connected graph.

, en:bipartite double cover 3-
.
, , 4- 4-
, ,
en:existential theory of the reals, , NP-.
,
en:arboricity ,
( ), .
, , 2-,
. ,
, .
,
, .[19]

en:Thue number ,
,
, , ,

.
en:arboricity ,
,
(
). ,
, .[20]

.[21] K4,4
, ,
en:List edge-coloring .
, ,
, ,
. ,
, ,
. .
en:Dinitz conjecture
, j
, . ( 1995) ,
,
.
. .
.
, en:complete coloring,
,
359
.[22]
en:strong coloring,
.[23]
en:channel allocation schemes .[24]
,
( , ).[25]
( 2008) 3- ,
. ,
,
. ,
3-, NP- .
, ,
, . , ,
, .
( en:Brooks' theorem),
, . .
3- 3-,
, (, ,
) , .
, ,
,
. , (
, )
,
, , , , ,
( ) .
. ,
, .

, , ,
.
,
, , ,
.[26]
en:deterministic finite automaton
,
- ,
. en:road coloring problem
,
. ( 2009) , ,
, en:aperiodic graph.
-
. ,
, . , , ,
2-, .
360

, .
, . .[27]
,
. , (,
), , ,
, ,
, .[28]
, , (
), ,
( ).
en:Open shop scheduling ,
, .
( ) ,
. ,
,
, ,
. , ,
, .
,
.[29]
, (, , 2005)

.
, .
( ,
) , ,
. ,
, ,
, .
, -
.
- en:path coloring
, , ,
,
. , ,
.
, ,
,
, , ,
, , ,
. , ,
, , ,
.[30]
361

(, 1995) 23 , .
:
( 1973),
,
.
(Jakobsen) en:critical graph
2,
, 1. ,
, , , .
, , ,
, .
, 2.
en:Overfull graph (A. J. W. Hilton), ,
1, ,
, , .
en:Herbert Grotzsch
.
(Chetwynd) (Hilton) (,
en:Gabriel Andrew Dirac),
1.
en:Claude Berge en:D. R. Fulkerson, 6-
, 3- ,
.
, , K1,3,
en:Uniquely colorable graph 3 .
, -
, - , -.
.
en:Maria Chudnovsky, (Katherine Edwards) en:Paul Seymour
(mathematician) , 8- 8.

[1] Soifer, 2008, problem 16.4, . 133
[2] , 2008
[3] , 16.5, p. 133. , , .
[4] , 1972
[5] ; ; .
[6] , p. 134.
[7] , 1916
[8] ,, 1977
[9] , , 2001
[10] ; .
[11] , p. 136.
[12] , 1949
[13] , , , 2010
[14] , , .
[15] , , , 2011
[16] , 2008
362
[17] , 1989
[18] , 1972
[19] ,,.
[20] -, 1964
[21] , , 1992
[22] , , 1976
[23] ;;;.
[24] ., 2006
[25] ,.
[26] , 2010
[27] , , , 2004
[28] , 2008
[29] ., 1997
[30] , , 2001

Jin Akiyama, Geoffrey Exoo, Frank HararyCovering and packing in graphs. III. Cyclic and acyclic invariants //
Mathematica Slovaca. 1980. .4. .30. .405417..
Noga AlonA simple algorithm for edge-coloring bipartite multigraphs // Information Processing Letters.
S0020-0190(02)00446-5).
Noga Alon, Benny Sudakov, Ayal ZaksAcyclic edge colorings of graphs // Journal of Graph Theory. 2001.
.3. .37. .157167. DOI: 10.1002/jgt.1010 (http://dx.doi.org/10.1002/jgt.1010).
Lars Dovling AndersenOn edge-colourings of graphs // Mathematica Scandinavica. 1977. .2.
.40. .161175.. , , 2011.
K. Appel, W. HakenEvery planar map is four colorable // Bulletin of the American Mathematical Society.
1090/S0002-9904-1976-14122-5).
Bahman Bahmani, Aranyak Mehta, Rajeev MotwaniProceedings of the Twenty-First Annual ACM-SIAM
Symposium on Discrete Algorithms (SODA '10). 2010. .3139..
Amotz Bar-Noy, Rajeev Motwani, Joseph NaorThe greedy algorithm is optimal for on-line edge coloring //
Information Processing Letters. 1992. .5. .44. .251253. DOI:
10.1016/0020-0190(92)90209-E (http://dx.doi.org/10.1016/0020-0190(92)90209-E).
C.L. Barrett, G. Istrate, V.S.A. Kumar, M.V. Marathe, S. Thite, S. ThulasidasanProc. Fourth Annual IEEE
International Conference on Pervasive Computing and Communications Workshops (PerCom Workshops
2006). 2006. .106. ISBN 0-7695-2520-2. DOI: 10.1109/PERCOMW.2006.129 (http://dx.doi.
org/10.1109/PERCOMW.2006.129).
Norman Biggs Research Problems / Richard K. Guy. American Mathematical Monthly. 1972. .79.
.10181020..
Norman BiggsSecond International Conference on Combinatorial Mathematics // Annals of the New York
Academy of Sciences. 1979. .319. .7181. DOI: 10.1111/j.1749-6632.1979.tb32775.x (http://dx.
doi.org/10.1111/j.1749-6632.1979.tb32775.x).
Andreas Bjorklund, Thore Husfeldt, Mikko KoivistoSet partitioning via inclusion-exclusion // SIAM Journal on
Computing. 2009. .2. .39. .546563. DOI: 10.1137/070683933 (http://dx.doi.org/10.
1137/070683933).
Juraj BosakChromatic index of finite and infinite graphs // Czechoslovak Mathematical Journal. 1972.
.22(97). .272290..
Juraj Bosak, Jaroslav NesetrilComplete and pseudocomplete colourings of a graph // Matematicky Casopis
Slovenskej Akademie Vied. 1976. .3. .26. .171184..
363
E. Burke, D. De Werra, J. Kingston{{{}}} / J. L. Gross, J. Yellen. CRC Press, 2004. .462.

ISBN 978-1-58488-090-5..
Guantao Chen, Xingxing Yu, Wenan ZangApproximating the chromatic index of multigraphs // Journal of
Combinatorial Optimization. 2011. .2. .21. .219246. DOI: 10.1007/s10878-009-9232-y
(http://dx.doi.org/10.1007/s10878-009-9232-y).
Richard Cole, John HopcroftOn edge coloring bipartite graphs // SIAM Journal on Computing. 1982.
Richard Cole, Lukasz KowalikNew linear-time algorithms for edge-coloring planar graphs // Algorithmica.
2008. .3. .50. .351368. DOI: 10.1007/s00453-007-9044-3 (http://dx.doi.org/10.1007/
s00453-007-9044-3).
Richard Cole, Kirstin Ost, Stefan SchirraEdge-coloring bipartite multigraphs in time //
Combinatorica. 2001. .1. .21. .512. DOI: 10.1007/s004930170002 (http://dx.doi.org/
10.1007/s004930170002).
Daniel W. CranstonStrong edge-coloring of graphs with maximum degree 4 using 22 colors // Discrete
Mathematics. 2006. .21. .306. .27722778. DOI: 10.1016/j.disc.2006.03.053 (http://dx.
doi.org/10.1016/j.disc.2006.03.053).
David Eppstein Proc. 16th Int. Symp. Graph Drawing / Ioannis G. Tollis, Marizio Patrignani. Heraklion, Crete,
2008. .5417. .7889. (Lecture Notes in Computer Science)..
David Eppstein Proc. 22nd Canadian Conference on Computational Geometry (CCCG 2010). 2010..
Paul Erdos, Robin J. WilsonNote on the chromatic index of almost all graphs // Journal of Combinatorial
Theory. 1977. .23. .23. .255257. DOI: 10.1016/0095-8956(77)90039-9 (http://dx.doi.
org/10.1016/0095-8956(77)90039-9).
Thomas Erlebach, Klaus JansenThe complexity of path coloring and call scheduling // Theoretical Computer
Science. 2001. .12. .255. .3350. DOI: 10.1016/S0304-3975(99)00152-8 (http://dx.doi.
org/10.1016/S0304-3975(99)00152-8).
S. Fiorini, R. J. Wilson Edge-colourings of graphs. London: Pitman, 1977. .16. (Research Notes in
Mathematics). ISBN 0-273-01129-4.
Jon Folkman, D. R. Fulkerson Combinatorial Mathematics and its Applications (Proc. Conf., Univ. North
Carolina, Chapel Hill, N.C., 1967). Chapel Hill, N.C.: Univ. North Carolina Press, 1969. .561577..
J.-L. Fouquet, J.-L. JolivetStrong edge-colorings of graphs and applications to multi -gons // Ars
Combinatoria. 1983. .A. .16. .141150..
Alan M. Frieze, Michael Krivelevich, Benny SudakovThe strong chromatic index of random graphs // SIAM
Journal on Discrete Mathematics. 2005. .3. .19. .719727 (electronic). DOI:
10.1137/S0895480104445757 (http://dx.doi.org/10.1137/S0895480104445757).
Harold N. GabowUsing Euler partitions to edge color bipartite multigraphs // International Journal of Computer
and Information Sciences. 1976. .4. .5. .345355. DOI: 10.1007/BF00998632 (http://dx.
doi.org/10.1007/BF00998632).
Harold N. Gabow, Takao Nishizeki, Oded Kariv, Daniel Leven, Osamu TeradaAlgorithms for edge-coloring
graphs. Tohoku University, 1985..
Harold N. Gabow, Herbert H. WestermannForests, frames, and games: algorithms for matroid sums and
applications // Algorithmica. 1992. .56. .7. .465497. DOI: 10.1007/BF01758774 (http://
dx.doi.org/10.1007/BF01758774).
F. GalvinThe list chromatic index of a bipartite multigraph // Journal of Combinatorial Theory. 1995.
.1. .63. .153158. DOI: 10.1006/jctb.1995.1011 (http://dx.doi.org/10.1006/jctb.1995.1011).
S. Gandham, M. Dawande, R. PrakashProc. 24th INFOCOM. 2005. .4. .24922501. ISBN
0-7803-8968-9. DOI: 10.1109/INFCOM.2005.1498534 (http://dx.doi.org/10.1109/INFCOM.2005.
1498534).
364
M. K. Gol'dbergMultigraphs with a chromatic index that is nearly maximal // Diskret. Analiz.. 1973.
.23. .37, 72.. , , 2011.
M. Habib, B. PerocheSome problems about linear arboricity // Discrete Mathematics. 1982. .2.
.41. .219220. DOI: 10.1016/0012-365X(82)90209-6 (http://dx.doi.org/10.1016/
0012-365X(82)90209-6).
Ian HolyerThe NP-completeness of edge-coloring // SIAM Journal on Computing. 1981. .4. .10.
.718720. DOI: 10.1137/0210055 (http://dx.doi.org/10.1137/0210055).
Peter Horak, Ludovit NiepelA short proof of a linear arboricity theorem for cubic graphs // Acta Mathematica
Universitatis Comenianae. 1982. .40/41. .275277..
Tommy R. Jensen, Bjarne Toft Graph Coloring Problems. New York: Wiley-Interscience, 1995. ISBN
0-471-02865-7.
Howard J. Karloff, David ShmoysEfficient parallel algorithms for edge coloring problems // Journal of
Algorithms. 1987. .1. .8. .3952. DOI: 10.1016/0196-6774(87)90026-5 (http://dx.doi.org/
10.1016/0196-6774(87)90026-5).
Uber Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre // Mathematische Annalen.
1916. .4. .77. .453465. DOI: 10.1007/BF01456961 (http://dx.doi.org/10.1007/
BF01456961).
Lukasz KowalikImproved edge-coloring with three colors // Theoretical Computer Science. 2009.
.3840. .410. .37333742. DOI: 10.1016/j.tcs.2009.05.005 (http://dx.doi.org/10.1016/j.tcs.
2009.05.005).
Mohammad MahdianOn the computational complexity of strong edge coloring // Discrete Applied
Mathematics. 2002. .3. .118. .239248. DOI: 10.1016/S0166-218X(01)00237-2 (http://dx.
doi.org/10.1016/S0166-218X(01)00237-2).
Guy H. J. Meredith, E. Keith LloydThe footballers of Croam // Journal of Combinatorial Theory. 1973.
.2. .15. .161166. DOI: 10.1016/0095-8956(73)90016-6 (http://dx.doi.org/10.1016/
0095-8956(73)90016-6).
J. Misra, D. GriesA constructive proof of Vizing's Theorem // Information Processing Letters. 1992.
.3. .41. .131133. DOI: 10.1016/0020-0190(92)90041-S (http://dx.doi.org/10.1016/
0020-0190(92)90041-S).
Rahul Muthu, N. Narayanan, C. R. SubramanianImproved bounds on acyclic edge colouring // Discrete
Mathematics. 2007. .23. .307. .30633069. DOI: 10.1016/j.disc.2007.03.006 (http://dx.
doi.org/10.1016/j.disc.2007.03.006).
Crispin Nash-WilliamsDecomposition of finite graphs into forests // Journal of the London Mathematical
Society. 1964. .39.
George Nemhauser, Sungsoo ParkA polyhedral approach to edge coloring // Operations Research Letters.
1991. .6. .10. .315322. DOI: 10.1016/0167-6377(91)90003-8 (http://dx.doi.org/10.1016/
0167-6377(91)90003-8).
David A. Richter Proc. 18th International Symposium on Graph Drawing (GD 2010) / Ulrik Brandes, Sabine
Cornelsen. Springer-Verlag, 2011. .6502. .353364. (Lecture Notes in Computer Science).
ISBN 978-3-642-18468-0 DOI: 10.1007/978-3-642-18469-7_32 (http://dx.doi.org/10.1007/
978-3-642-18469-7_32).
Daniel P. Sanders, Yue ZhaoPlanar graphs of maximum degree seven are class I // Journal of Combinatorial
1006/jctb.2001.2047).
P. D. SeymourOn multicolourings of cubic graphs, and conjectures of Fulkerson and Tutte // Proceedings of the
London Mathematical Society. 1979. .3. .38. .423460. DOI: 10.1112/plms/s3-38.3.423
(http://dx.doi.org/10.1112/plms/s3-38.3.423).
365
Allen J. SchwenkEnumeration of Hamiltonian cycles in certain generalized Petersen graphs // Journal of

Combinatorial Theory. 1989. .1. .47. .5359. DOI: 10.1016/0095-8956(89)90064-6 (http://
dx.doi.org/10.1016/0095-8956(89)90064-6).
Claude ShannonA theorem on coloring the lines of a network // J. Math. Physics. 1949. .28.
.148151..
Steven S. SkienaThe Algorithm Design Manual. Springer-Verlag, 2008. .548550. ISBN
978-1-84800-069-8. DOI: 10.1007/978-1-84800-070-4_16 (http://dx.doi.org/10.1007/
978-1-84800-070-4_16). (http://www.cs.sunysb.edu/~algorith/files/edge-coloring.shtml)
Stony Brook Algorithm Repository.
Alexander Soifer The Mathematical Coloring Book. Springer-Verlag, 2008. ISBN 978-0-387-74640-1.
P. G. TaitRemarks on the colourings of maps // Proc. R. Soc. Edinburgh. 1880. .10. .729..
TrahtmanThe road coloring problem // Israel Journal of Mathematics. 2009. .1. .172.
.5160. DOI: 10.1007/s11856-009-0062-5 (http://dx.doi.org/10.1007/s11856-009-0062-5)
ariv:0709.0099.
V. G. VizingOn an estimate of the chromatic class of a p-graph // Diskret. Analiz.. 1964. .3. .2530..
V. G. VizingCritical graphs with given chromatic class // Metody Diskret. Analiz.. 1965. .5. .917..
( .)
D. P. Williamson, L. A. Hall, J. A. Hoogeveen, C. A. J. Hurkens, J. K. Lenstra, S. V. Sevast'janov, D. B.
ShmoysShort shop schedules // Operations Research. 1997. .2. .45. .288294. DOI:
10.1287/opre.45.2.288 (http://dx.doi.org/10.1287/opre.45.2.288).
Xiao Zhou, Shin-ichi Nakano, Takao NishizekiEdge-coloring partial -trees // Journal of Algorithms.
1996. .3. .21. .598617. DOI: 10.1006/jagm.1996.0061 (http://dx.doi.org/10.1006/jagm.
1996.0061).
k-
, G k--,
k .

. ,
k- . , k--,
(k1)--.

. , ,
k--, , ,
. , , v,
v .

k, G
k--. .
(u,v) u v ,
. k--, u v k
k- 366
(u,v). k u-v- (u,v).

n ,
, , , .
, .
(u,v), u
, v .
. k, u .
, en:Gabow's algorithm, . [1]
, k-- G ( ,
G, k-- ) NP-
.[2]

k--

en:Matching preclusion

en:Robbins theorem

[1] Harold N. Gabow. A matroid approach to finding edge connectivity and packing arborescences. J. Comput. Syst. Sci., 50(2):259273, 1995.
[2] M.R. Garey and D.S. Johnson. Computers and Intractability: a Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA, 1979.
-
- G , e1 e2
G, G, e1 e2.
, -,
.

- 367
-
, ,
.
- ( ),
-
-. ,
-,
-.
,
.
- , ,
-,
en:semi-symmetric graph. -
. - , -.
,
en:biregular graph.

en:Edge-transitive ( )

Weisstein, Eric W. Edge-transitive graph (http://mathworld.wolfram.com/Edge-TransitiveGraph.html)(.)
Wolfram MathWorld.
368

L(G) G L(G),
G.
,
. , : ,
, ,
--, ,
().
, ,
G . ,
, .

G, L(G) ,
L(G) G
L(G) ,
() G.

(, ) (,
).
. , 1,3
1 3. 1,3 : 1,4, 1,2 (
1 ) 4,3 ( 3
).
G L(G), L(G) L(G)

G
369

Kn ( ).
, ,
en:Spectral graph theory, n = 8, ,
L(K8). en:Two-graph.

.
.
. , ...
, , ,
.
( )
.

.
, ,
.
, . ,
,
.

G,
L(G), . , G ,
, L(G),
, , en:Independent set (graph theory).
,
. G , , ,
L(G), L(G). , G,
, ,
.

.
,

.
G
L(G).
- - .
G , G ,
. (
.)
, .
370
en: .

G
-
,
G, G ,
G
. ,

.
, G
,
.
, ,
G

, , (Beineke)
. , .
,
,
.

, .
(Roussopoulos)
.
, , ,
:
, 4- ,
.
, , ,
. ,
.
( ).
, , , , ,
, .
, ,
. ( ,
K1,3), . ,
, . 5
.
en:Line graphs of hypergraphs.
371
, G
:
G , L(G) G.
, L(G) G.
G K1,3, L(G) .
G , ,
.
.
G , G.

.
( en:Knig's theorem (graph
theory)). ,
. ,
.

G ,
G , , , .
, K1,n , en:Dipole graph
.

.. G ,
G.
, u v w x G uv wx ,
v = w. , 2 .
,
.

k G k(k-1)/2 L(G).
, G
L(G). , , G. e
f. , e , v,
L(G).
, v f. e G
O(k), O(k2) L(G).
372
, ,
G, , .
, , ,
. . , d e G
v, k, L(G) , d
e 1/(k-1). G (
'1') 2 L(G), G.

, en:Line
graphs of hypergraphs , .

Andreas Brandstdt, Van Bang Le, Jeremy P. SpinradGraph Classes: A Survey. SIAM Monographs on
Discrete Mathematics and Applications, 1999. ISBN 0-89871-432-X..
( )
, , Rn,
en:regular tiling. , ,
, - .

( ).
. ,
, , , "88 ".
,
.

( , )
, , x-
1,..., n, y- 1,..., m, ,
1. ,
.
( ) 373

, n - 1 m - 1 .
, .
.
n 1. 2x2 4-.

, .
,
, .
(, ),
.

en:Integer triangle

374

, 5
H(S) S
S.
,
en:rectilinear Steiner tree S.[1] . , [2]
.[3]

[1] Martin Zachariasen, A Catalog of Hanan Grid Problems (http:/ / citeseerx. ist. psu. edu/ viewdoc/ summary?doi=10. 1. 1. 43. 3586) Networks,
vol. 38, 2000, pp. 200-221
[2] Christine R. Leverenz, Miroslaw Truszczynski, The Rectilinear Steiner Tree Problem: Algorithms and Examples using Permutations of the
Terminal Set (http:/ / portal. acm. org/ ft_gateway. cfm?id=306402& type=pdf), 1999 ACM Southeast Regional Conference, 1999,
[3] M. Hanan, On Steiner's problem with rectilinear distance (http:/ / amadeus. ecs. umass. edu/ mie373/ hanan_rsmt. pdf), J. SIAM Appl. Math.
14 (1966), 255 - 265.

,
.
, 4 5 .

. ,
33 ( )
,
,
.
37
.
: N
37, 41 49 ,
, Z.
.

n , ..,
n(n1)/4 ,
375
( ) 2,
3. n(n1) 4, n
0 1 4. , 6
.

,
,
,
en:polynomial-time equivalent
en:graph isomorphism problem.
:
, .

Weisstein, Eric W. Self-Complementary Graph (http://mathworld.wolfram.com/{{{urlname}}}.html)(.)
Wolfram MathWorld.

G , ,
.
G , ( ),
.

' , ,
n. '
376

' , V
V1 V2 ,
. '
.
G(V,E) . v V1 ,
v V, v. V1
( , , v) V ( V1=V G(V,E)-
, .. , v).
V2=V \ V1.
V2 , G(V,E) V1
V2. V1 V2 V.
, V1 V2, V, .
, G(V,E) . v V1 w V2 ,
, , . ,
, . .
w v, w=v, v
w.

'
' G ,
.

'
' :
1. .
2. .
3., , .
4. .
5. , .
377

4 5.
4. G1(V1,E1) G(V,E) . V2=V
\V1 G, G1(V1,E1) . V2
, G(V,E) G1(V1,E1).
5. G(V,E) n, G=(V,E) - n. G ,
. G G1(V1,E1) V2=V \V1 .
v V1 , w V2 -, G vw E . ,
V2 V1 , E , V1
2, E . G .

, . ,
.

.
, , , ,
( ),
(
).

.
-, ()
, , ,
.
-, ,
.

() :
(), :
1.
2.
3.
4. ,
5. , (
)
6. 2 1 ,

378

,
,
() .

. .

, , , ,
( , , , ..)
( , ..).
. ,
.
,
. , , ,
.

(
) , ( ) .
, , , .
, . , ,
, . ,
. ,
.

,
.
.
(Lm).
,
.

, ( ),
( ).
:
1. (, ), ,
.
2. , .
379
,
(, ), ,
. , /
, . ,
, .
PERT.
:
( ),
, ;
, ;
() , ,
, ,
( ).
: ( )
().
:
;
, ;
, ,
(
).
, .
,
, .
:
, ,
;
, ;
, , ;
i j , - i j,
.
,
(. ).
380
,
, .
, , , ,
, , ( ).
.

:
. ,
;
, ,
;
, , ,
;
.

,
.
G = (V,E) v
k. , G
, , :

.

.

srg(v,k,,).
,
, ,
13- ,
,
srg(13,6,2,3).
,[1][2],
, en:Turn graph.
- 2, ,
.
381

srg(v,k,,) :
, :
. , 0.
k 1, 2.
1 , ,
, 1.
k, , 1 2.
2 ,
, 1. , 1
2 k 1 2.
, 2 .
, ,
, .
I ( v) J ,
1. A :

( k).

( , , . ,
, . , ,
, ).
:
, en:Multiplicity (mathematics) 1
, ,
.
.
, ,
.
srg(v,k,,) srg(v, vk1, v22k+, v2k+).
382

5 srg(5,2,0,1).
srg(10,3,0,1).
srg(16,5,0,2).
en:Shrikhande graph srg(16,6,2,2),
-.
en:generalized quadrangle GQ(2,4) srg(27,10,1,5).
srg(27,16,10,8).
en:Chang graphs srg(28,12,6,4).
en:HoffmanSingleton graph srg(50,7,0,1).
en:Sims-Gewirtz graph (56,10,0,2).
M22en:M22 graph srg(77,16,0,4).
en:BrouwerHaemers graph srg(81,20,1,6).
en:HigmanSims graph srg(100,22,0,6).
en:Local McLaughlin graph srg(162,56,10,24).
of order q srg(q, (q1)/2, (q5)/4, (q1)/4).
nn srg(n2, 2n2, n2, 2).
, , .
, =0 =k.

=0 . 3
.
=0 =1 5. , , ,
(5,2,0,1), (10,3,0,1) (50,7,0,1), .
, (3250,57,0,1).
, , , .

en:Seidel adjacency matrix

[1] Brouwer, Andries E; Haemers, Willem H. Spectra of Graphs. p. 101 (http:/ / homepages. cwi. nl/ ~aeb/ math/ ipm. pdf)
[2] Godsil, Chris; Royle, Gordon. Algebraic Graph Theory. Springer-Verlag New York, 2001, p. 218.

A.E. Brouwer, A.M. Cohen, and A. Neumaier (1989), Distance Regular Graphs. Berlin, New York:
Springer-Verlag. ISBN 3-540-50619-5, ISBN 0-387-50619-5
Chris Godsil and Gordon Royle (2004), Algebraic Graph Theory. New York: Springer-Verlag. ISBN
0-387-95241-1
383

. en:Eric W. Weisstein, Mathworld . (http://mathworld.
wolfram.com/StronglyRegularGraph.html)
en:Gordon Royle, . (http://people.csse.uwa.edu.au/gordon/
remote/srgs/)
Andries E. Brouweren:Andries E. Brouwer, . (http://www.win.tue.nl/
~aeb/graphs/srg/srgtab.html)
Brendan McKayen:Brendan McKay, . (http://cs.anu.edu.au/~bdm/data/graphs.html)
Ted Spence, Strongly regular graphs on at most 64 vertices. (http://www.maths.gla.ac.uk/~es/srgraphs.html)

(
) G,
u1v1 u2v2 :
f : V(G) V(G)
, :
f(u1) = u2 and f(v1) = v2.
, ,

( ,
).
1-
-.
()
.
-.
,

.
,
-. , -
, ab cd, dc.
en:Semi-symmetric graph, , - ,
-.
-, -,
.
- - , .[1]
en:half-transitive graph. ,
4 27 . ,
, - -.
, .
- ,
. .
t- t+1 ,
, 2 .
t-, t-, (t+1)-.
384
1- , 3 t-
t, t . 2-,
.

, ( 3),
,
. .[2] 1930-
.. en:R. M. Foster Bell Labs,[3] 1988 ( 92)
( 512 ,
) .[4]
, 30 [5][6] ( -),
4 1 3 K4 ,
2-
6 2 4 K3,3 ,
3-
8 3 4 ,
2-
10 2 5 ,
3-
14 3 6 ,
4-
16 4 6 - 2-
18 4 6 ,
3-
20 5 5 ,
2-
20 5 6 ,
3-
24 4 6 en:Nauru graph ( 2-
G(12,5))
26 5 6 F26Aen:F26A graph 1-
28 4 7 en:Coxeter graph ,
3-
30 4 8 ,
5-
en:Dyck graph,
en:Foster graph en:BiggsSmith graph. -
. en:Foster graph en:BiggsSmith graph
- .
( 2), ( 4 5
), ( 4 16 ) ,
, , .
.
385

d. ,
- 2(d+1)/3.
t- 3 2(t-1).
t- 3 t 8. , (
), t 6.

[1] Bouwer, Z. Vertex and Edge Transitive, But Not 1-Transitive Graphs. Canad. Math. Bull. 13, 231237, 1970.
[2] , Trivalent symmetric graphs on up to 768 vertices (http:/ / www. math. auckland. ac. nz/ ~conder/ preprints/ cubic768. ps), J. Combin. Math.
Combin. Comput, vol. 20, pp. 41-63
[3] Foster, R. M. Geometrical Circuits of Electrical Networks. Transactions of the American Institute of Electrical Engineers 51, 309317,
1932.
[4] The Foster Census: R.M. Fosters Census of Connected Symmetric Trivalent Graphs, by Ronald M. Foster, I.Z. Bouwer, W.W. Chernoff,
B. Monson and Z. Star (1988) ISBN 0-919611-19-2
[5] Biggs, p. 148
[6] Weisstein, Eric W., Cubic Symmetric Graph (http:/ / mathworld. wolfram. com/ CubicSymmetricGraph. html), from Wolfram MathWorld.

Cubic symmetric graphs (The Foster Census) (http://people.csse.uwa.edu.au/gordon/remote/foster/). Data
files for all cubic symmetric graphs up to 768 vertices, and some cubic graphs with up to 1000 vertices. Gordon
Royle, updated February 2001, retrieved 2009-04-18.
Trivalent (cubic) symmetric graphs on up to 2048 vertices (http://www.math.auckland.ac.nz/~conder/
symmcubic2048list.txt). Marston Conder, August 2006, retrieved 2009-08-20.
386

.
,
. .

. ,
,
.
en:ErdsRnyi model.
.

n
.
, .
. ,
en:Edgar Gilbert G(n,p),
0 < p < 1. m
pm(1p)Nm. en:ErdsRnyi model, G(n,M),
, M . 0M
N, G(n,p)
(M) ,
n ,
.

0 < p < 1, G, .
, p 0 1, G :
n + m , c V,
.
, , , en:up to ,
, . ,
,
. ,
() , .
, ,
.
. uv u v
u v .
en:network probability matrix
, .
, ,
.
387
M pN, N , G(n,M) G(n,p),

.[1]
en:Random regular graph , ,
.
, .
, , , .

' '
, .

,
, . ,
n p, , G(n,p) .
,
n.
, .
( ). n
. 1p p .
, ,
pc .
en:probabilistic method,
.
, en:Szemerdi regularity lemma,
.
en:random regular graph G(n,r-reg) r-
r = r(n), n m , 3 r < n, rn = 2m .
G Gn
M GM , GM
1, GM , n, GM
. , ,
, .
1
(n/4)log(n) , 1
, , , .
c n cnlog(n)
. , 1, ,
2, .
388

G n V(G) = {1, , n},
( 1 1, 2 1 1,
2, ).

en:random tree en:Arborescence (graph
theory), . n
M(n) k .
en:uniform spanning tree,
en:random minimal spanning tree, en:random binary tree,
, en:rapidly exploring random tree,
.

1959 On Random Graphs
Random graphs.

[1] ">

J3, J5
J7.
4n
6n
3 n=3
5 n=5
6 n7
n5
389
J5
20
30

en:Hypohamiltonian graph
,
1975.[1]
, 4.
.

Jn :
n 4 . Ai,
Bi, Ci Di. 4n 3n (Ai-Bi, Ai-Ci Ai-Di
1in).
n (B1... Bn). n .
2n (C1... CnD1... Dn). 2n .
Jn 4n 6n .
, n .

J5, 20 30 . 6
20 ( A130315 OEIS). J5
en:Hypohamiltonian graph.
J3 ,
- .
en:Tietze's graph. ,
5 . , J3 .
390
J5 3 J5 4. J5.

[1] Isaacs, R. "Infinite Families of Nontrivial Trivalent Graphs Which Are Not Tait Colorable." Amer. Math. Monthly 82, 221239, 1975.
( )
c
4. , ,

,
. (
3 4.)
, ,
5.
The Electronic Journal of Combinatorics

,

en:flower snark J5
(,
20 .
en:Cycle double cover conjecture
5-) , -
, .
, .
(Miroslav Chladn)

. . 1880, ,
, .
, 1898. 1946 en:Danilo Blanua
, 18 , .
en:W. T. Tutte, en:Blanche Descartes,
210.[1][2] 1973 en:Szekeres snark.
( ) 391
1975
en:flower snark BDS ( ), ,
, en:Descartes snark . 30 ,
BDS en:Double-star snark
1976
.

en:hypohamiltonian graph
.
, 3 .
, .
( , .) OEIS
A130315 2n n.
en:Cycle double cover conjecture ,
, , , ,
en:graph embedding , .
, .
,
, ,
. .

en:W. T. Tutte , en:minor
(graph theory). , , , ,
. (
), , ,
.
, , ,
. 1999, en:Neil Robertson (mathematician), en:Daniel P. Sanders,
en:Paul Seymour (mathematician) en:Robin Thomas (mathematician)
. , 2012 .
, .

, , 4-.
, {1, 2, 3} ,
. ,
,
, .
( ).[3]
( ) 392

(10 , 1898)
en:Tietze's graph (12 , , )
( 18 , , 1946)
en:Descartes snark (210 , en:W. T. Tutte 1948)
en:Double-star snark (30 )
en:Szekeres snark (50 , 1973)
(50 , 1989)
( 20, 28, 36, 44... , 1975)
36 , 36 4,
, , 2012.

[1] Blanche Descartes, Network-colourings, The Mathematical Gazette (London) 32, 67-69, 1948.
[2] Martin Gardner, The Last Recreations: Hydras, Eggs, and Other Mathematical Mystifications, Springer, 2007, ISBN 0-387-25827-2, ISBN
978-0-387-25827-0

Weisstein, Eric W. Snark (http://mathworld.wolfram.com/Snark.html)(.) Wolfram MathWorld.
Alen Orbani, Toma Pisanski, Milan Randi, and Brigite Servatius (preprint). " Blanua Double (http://www.
ijp.si/ftp/pub/preprints/ps/2004/pp914.ps)". Institute for Mathematics, Physics and Mechanics in Ljubljana,
Slovenia.
393
. .
18 ()
27 ()
4 ()
5 ()
3 ()
4 ()
()
en:Hypohamiltonian graph
()
()
en:Toroidal graph ( )
3- 18 27 .
en:Danilo Blanua 1946 .[1]
, .
,
4. 3, 4 5. ,
en:hypohamiltonian graph.[2]

8 D4,
.
4
, Z/2Z .
:
394

8n+10, .
.[3]
2007 (J. Mazak) ,
.[4]
2008 (M. Ghebleh) ,
.[5]

3. 4. 3. 4.

[1] , "Problem cetiriju boja." Glasnik Mat. Fiz. Astr. Ser. II. 1, 31-42, 1946.
[2] Eckhard Steen, "On Bicritical Snarks" Math. Slovaca, 1997.
[3] Read, R. C. and Wilson, R. J. An Atlas of Graphs. Oxford, England: Oxford University Press, pp. 276 and 280, 1998.
[4] J. Mazak, Circular chromatic index of snarks, Master's thesis, Comenius University in Bratislava, 2007.
[5] M. Ghebleh, Circular Chromatic Index of Generalized Blanua Snarks, The Electronic Journal of Combinatorics, vol 15, 2008.
395
. .
50
75
50 75 .[1] .
1989.[2]
,
4. .
50 en:Szekeres snark,
. 1973.
396
3. 4.

[1] Watkins, J. J. and Wilson, R. J. "A Survey of Snarks." In Graph Theory, Combinatorics, and Applications (Ed. Y. Alavi, G. Chartrand, O. R.
Oellermann, and A. J. Schwenk). New York: Wiley, pp. 1129-1144, 1991
[2] Watkins, J. J. "Snarks." Ann. New York Acad. Sci. 576, 606-622, 1989.
397

,

.
en:strong perfect graph theorem,
2002 ,
, . G
G,
(5
).

,
. ,
,
9- , .
.
. ,
.
.
, ,

.
1958- en:Tibor Gallai,

,
. en:Knig's
theorem (graph theory),
. " " 1963-
en:Claude Berge, " ".

. 2002-
en:strong perfect graph theorem.

:
, . ,
.
( en:Knig's theorem (graph theory)).
( ) .
, 4 ,
, . , "k"-en:K-tree
( ), (,
), en:block graph (,
), (,
, ),
398
en:trivially perfect graph ( ),

en:threshold graph (,
), en:windmill graph (
) en:strongly chordal graph ( ,
).
en:Comparability graph,
, .
, , , ,
, en:permutation graph (,
, ) en:cograph (,
).
en:Perfectly orderable graph ,
, en:greedy coloring
. , ,
, - en:Distance-hereditary graph (
)
en:windmill graph, .
,
. , , ,
.
.

,
. ,
, , . ,
, . , ,
, .
,
, , .
. ,
,
en:antichain, ,
en:Comparability graph . en:Mirsky's theorem
,
.
en:permutation graph ,

.
.
en:Knig's theorem (graph theory) ,
.
. ,
,
.
399

,
.
en:perfect graph theorem (1972)
, , . ,
(
)
.
, ,

en:forbidden graph characterization
.
5
. ,
.
3
, .
, . (
, ).
, .
2k+1 ,
k+1,
k. (
). ,
, . ,
.
en:strong perfect graph theorem en:Maria Chudnovsky, en:Neil Robertson
(mathematician), en:Paul Seymour (mathematician), en:Robin Thomas (mathematician) (2006).
,
.
. ,
, .

,
(Grtschel, Lovsz,
Schrijver, 1988) [1].
, ,
.

. , co-NP
(Lovsz 1983). ,
.
400

[1] . 9, "Stable Sets in Graphs"
Berge, ClaudeFrbung von Graphen, deren smtliche bzw. deren ungerade Kreise starr sind // Wiss. Z.
Martin-Luther-Univ. Halle-Wittenberg Math.-Natur. Reihe. 1961. .10. .114.
Berge, ClaudePerfect graphs. Calcutta: Indian Statistical Institute, 1963. .121.
Chudnovsky, Maria;en:Maria Chudnovsky, Robertson, Neil;en:Neil Robertson (mathematician), Seymour,
Paul;en:Paul Seymour (mathematician), Thomas, Robin;en:Robin Thomas (mathematician) Vukovi,
KristinaRecognizing Berge graphs // Combinatorica. 2005. .2. .25. .143186. DOI:
10.1007/s00493-005-0012-8 (http://dx.doi.org/10.1007/s00493-005-0012-8)
Chudnovsky, Maria;en:Maria Chudnovsky, Robertson, Neil;en:Neil Robertson (mathematician), Seymour,
Paul;en:Paul Seymour (mathematician), Thomas, Robin;en:Robin Thomas (mathematician)The strong perfect
graph theorem // Annals of Mathematics. 2006. .1. .164. .51229. DOI:
10.4007/annals.2006.164.51 (http://dx.doi.org/10.4007/annals.2006.164.51)
Gallai, TiborMaximum-minimum Stze ber Graphen // Acta Math. Acad. Sci. Hungar.. 1958. .3-4.
Golumbic, Martin CharlesAlgorithmic Graph Theory and Perfect Graphs. Academic Press, 1980.
Lovsz, LszlNormal hypergraphs and the perfect graph conjecture // Discrete Mathematics. 1972.
.3. .2. .253267. DOI: 10.1016/0012-365X(72)90006-4 (http://dx.doi.org/10.1016/
0012-365X(72)90006-4)
Lovsz, LszlA characterization of perfect graphs // Journal of Combinatorial Theory, Series B. 1972.
.2. .13. .9598. DOI: 10.1016/0095-8956(72)90045-7 (http://dx.doi.org/10.1016/
0095-8956(72)90045-7)

The Strong Perfect Graph Theorem (http://www.cs.concordia.ca/~chvatal/perfect/spgt.html) by Vclav
Chvtalen:Vclav Chvtal.
Open problems on perfect graphs (http://www.aimath.org/WWN/perfectgraph/), maintained by the American
Institute of Mathematics.
Perfect Problems (http://www.cs.concordia.ca/~chvatal/perfect/problems.html), maintained by Vclav
Chvtal.
Information System on Graph Class Inclusions (http://www.graphclasses.org/index.html): perfect graph (http:/
/www.graphclasses.org/classes/gc_56.html)
401

(.Social
graph) ,

,

(:
, ,
..), , -[1]
..,
[2][3].

(.Implicit social graph)
,
(, )

.
, ,
. . ,
. Last.fm
Youtube.
,
[4].
, : [],
[] [].
, [].
, : []; [];
, -, ..[]; []
[] . [],
[], [].

, ,
, / .
.

.
[5] (.Homophily) , .
, , , .. [6]
(.Multiplexity) , .
[7]
, , ,
[8]
2. .
402
(.Mutuality/Reciprocity) , ,
. [9]
(.Network Closure) ,
. . ,
. [10]
(.Propinquity)
. [9]

, ,
.
(.Bridge) , ,
( ).
. [11]
(.Centrality) ,
( ) . [12][13]
,
, ,
. [14]
(.Density) , . [15][16]
(.Distance) ,
.
(.Structural holes) .
(.Tie Strength) ,
.[11] .
, , .

, ,
.
(.Cliques) , (
() ) . [17]
(.Social circles) ,
. [18]
(.Clustering coefficient) ,
, , .
, .
(.Cohesion) , ,
, .
, . [17]
403

,

.[19]
-
(.Feature-driven Models)

,

[19]

(Forest Fire)
- (.Intent-driven Models)
.
/ (Random Walk)
(Nearest Neighbor)
- (.Structure-driven Models)
,
.
(Kronecker graphs)
dK- (dK-graphs)

, , . [20]
, ,
:
1.
2.
404

(, , ..),
, . [3]

,
.
, , ,
, . [21]
-, , .. [22]

[22]:
[23]
, .
.
.

(.Open source intelligence, OSINT)
, , .. [24]

, -
.
: [25]
: / ,
: /
( ) ,
: , ,
.
:
: .
, ,
: , .
:
1.
2.
: - ,
. -,
: ,
.
405

.

. [20]

(, , - ..). [22]

. [26]
-, [27] -
.
-, , , ,
.. . Single Page Application
, Ajax DHTML,
.

[1] - (http:/ / dic. academic. ru/ dic. nsf/ dic_synonims/ 228920/ )
[2] , 2012, pp. 3
[3] , 2010, pp. 199
[4] Suggesting Friends, 2010, pp. 2
[5] , 2012, pp. 168-169
[6] , 2001, pp. 415-444
[7] , 1997, pp. 673-693
[8] , 2003
[9] , 2012
[10] , 2010, pp. 855-869
[11] , 1973, pp. 1360-1380
[12] , 2010, p. 32
[13] , 2011, pp. 364-367
[14] , 2010, pp. 245
[15] , 2006, pp. B-11 - B-12
[16] : , 2010, pp. 25
[17] , 2011, pp. 149
[18] , 2011, pp. 346-347
[19] Social Graph Models, 2010, pp. 3-4
[20] , 2012, pp. 2-4
[21] Suggesting Friends, 2010, pp. 2-7
[22] , 2012, p. 34
[23] , 2002, . 187
[24] OSINT, 2012, pp. 21-39
[25] Crawling OSN, 2010, pp. 1-7
[26] Crawling OSN, 2010, pp. 1
[27] Crawling OSN, 2010, pp. 3
406

M. Granovetter The strength of weak ties (http://www.jstor.org/discover/10.2307/2776392?uid=3738936&
uid=2&uid=4&sid=21101493644487)(.). American Journal of Sociology, 1973.
Melville P.,Mooney R., Nagarajan R. Content-Boosted Collaborative Filtering for Improved Recommendations
(http://www.aaai.org/Papers/AAAI/2002/AAAI02-029.pdf)(.) // University of Texas, USA :
. / AAAI-02, Austin, TX, USA, 2002. 2002. .187-192.
J.M. Podolny, J.N. Baron Resources and relationships: Social networks and mobility in the workplace (http://
jaylee.business.ku.edu/MGMT 916/PDF/Podolny1997ASR.pdf)(.). American Sociological Review,
1997.
N. McPherson, L. Smith-Lovin, J.M. Cook%20smith-lovin%20cook%20ars.pdf Birds of a feather: Homophily in
social networks (ftp://www.soc.cornell.edu/csi/Networks/mcpherson)(.). Annual Reviews, Annual
Review of Sociology, 2001.
M. Kilduff, W. Tsai Social networks and organisations (http://books.google.ru/books/about/
Social_Networks_and_Organizations.html?id=C-Bd8RrqBXsC&redir_esc=y)(.). Sage Publications,
2003. .172.
C. Kadushin Social Network Analysis (http://www.fas.org/irp/doddir/army/fm3-24.pdf). Headquarters,
Department of the Army, Washington, DC, 2006. ISBN 978-1-84787-395-8
A.-K. Pietilinen, E. Oliver, J. LeBrun MobiClique: Middleware for Mobile Social Networking (http://www.
cin.ufpe.br/~redis/intranet/bibliography/middleware/pietilainen-mobiclique-2009.pdf)(.). WOSN09,
August 17, 2009, Barcelona, Spain, 2009.
Xu, Guandong et al Web Mining and Social Networking: Techniques and Applications (http://books.google.
com/books?id=mXo9zKeYa6cC&pg=PA25). Springer, 2010. ISBN 978-1-4419-7734-2
D. Hansen, B. Shneiderman, M. A. Smith Analyzing Social Media Networks with NodeXL (http://www.google.
ru/books?hl=ru&lr=&id=rbxPm93PRY8C&oi=fnd&pg=PP2&dq=Analyzing+Social+Media+Networks+
with+NodeXL&ots=MwiB62WiI8&sig=5spIY688QJH8681V4TiEMSRi1rE&redir_esc=y). Morgan
Kaufmann, 2010. .283. ISBN 978-0-12-382229-1
Shaozhi Ye, Juan Lang, Felix Wu Crawling Online Social Graphs (http://alpha.nyit.edu/som/faculty/khoo/
Spring2012/MIST760/Others/2010 Crawling Online Social Graphs_apweb10.pdf)(.). APWEB12, April
6-8, 2010, Busan, Korea, 2010.
C. McCarthy Facebook: One Social Graph to Rule Them All? (http://www.cbsnews.com/stories/2010/04/21/
tech/main6418458.shtml)(.). CBS Interactive Inc., 2010.
T. Opsahl, F. Agneessens, J. Skvoretz Node centrality in weighted networks: Generalizing degree and shortest
paths (http://toreopsahl.com/2010/04/21/
article-node-centrality-in-weighted-networks-generalizing-degree-and-shortest-paths/)(.). Social
Networks, 2010.
M. Roth, A. Ben-David, D. Deutscher Suggesting Friends Using the Implicit Social Graph (http://dejanseo.com.
au/research/google/36371.pdf)(.). KDD10, July 2528, 2010, Washington, DC, USA., 2010.
A. Sala, L. Cao, C. Wilson, R. Zablit, H. Zheng, B. Y. Zhao Measurement-calibrated Graph Models for Social
Network Experiments (http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.154.1021&rep=rep1&
type=pdf)(.). WWW 2010, April 2630, 2010, Raleigh, North Carolina, USA, 2010.
D. Horowitz, Sepandar D. Kamvar The Anatomy of a Large-ScaleSocialSearch Engine (http://www.ra.ethz.
ch/CDstore/www2010/www/p431.pdf)(.). WWW 2010, April 2630, 2010, Raleigh, North Carolina,
USA., 2010.
407
F.J. Flynn, R.E. Reagans, L. Guillory Do you two know each other? Transitivity, homophily, and the need for
(network) closure. (http://francisflynn.com/www/wp-content/uploads/2010/03/
Do-you-two-know-each-other.pdf)(.). Journal of Personality and Social Psychology, 2010.
J. Ugander, B. Karrer, L. Backstrom, C. Marlow The Anatomy of the Facebook Social Graph (http://arxiv.org/
pdf/1111.4503v1.pdf)(.). Cornell University Library, 2011.
My T. Thai, Panos M. Pardalos Handbook of Optimization in Complex Networks: Communication and Social
Networks (http://books.google.com/books?id=bdRdcHxQQLQC&pg=PA149). Springer, 2011.
.541. ISBN 978-1-4614-0856-7
P. J. Carrington, J. Scott The Sage Handbook of Social Network Analysis (http://www.google.ru/
books?hl=ru&lr=&id=mWlsKkIuFNgC&oi=fnd&pg=PP1&dq=The+Sage+Handbook+of+Social+
Network+Analysis&ots=tOdD0Sg__p&sig=NkD7nwe18YmEfGKP7wJKqibhCKc&redir_esc=y). SAGE,
2011. .640. ISBN 978-1-84787-395-8
D. Schioberg, F. Schneider, H. Schioberg, S. Schmid, S. Uhlig, Anja Feldmann Tracing the Birth of an OSN:
Graph and Prole Analysis in Google+ (http://www.net.t-labs.tu-berlin.de/papers/SSSSUF-TBOSGPAG-12.
pdf)(.). WebSci 2012, June 2224, 2012, Evanston, Illinois, USA, 2012.
M. P. Zillman Online Social Networks (http://whitepapers.virtualprivatelibrary.net/Online Social Networks.
pdf)(.). Virtual Private Library, 2012.
B. R. Holland Enabling Open Source Intelligence (OSINT) in private social networks (http://gradworks.umi.
com/1512318.pdf)(.) : Masters's dessertation. Iowa State University, Ames, Iowa, 2012.
C. Kadushin Understanding social networks: Theories, concepts, and findings (http://www.lavoisier.fr/livre/
notice.asp?ouvrage=2601353). Oxford: Oxford University Press, 2012. .288.
.. . . (http://www.
v-school.narod.ru/BOOK/cc-public.doc). .: , 2010. .180.
. , .
(http://modis.ispras.ru/wp-content/uploads/2010/10/
__
______
__-_2012-02-20.pdf)(.).
, 2012.
.. (http://se.math.spbu.ru/SE/diploma/2012/m/
Dzyuba_m_thesis.pdf)(.) : . -
, 2012.
. . : (http://ecsoc.hse.ru/data/2012/11/
30/1234591727/ecsoc_t13_n5.pdf#page=168)(.).
: ? 2528, 2012,
, , 2012. .168-169.
408

,
,

. ,

. ,
,
.

,
. .
The Harborth graph
,
. , (
, ) , 0-, 1-
2- . 3-
,
.
8- .
3-
.
1986 , ,
. 104 52 ,
4- .[1]
.

.
(Kurz, Mazzuoccolo) ,
3- (4) 20
. ,
3- 5 (180 ). 8-
.
409

, ,
NP- .

( ) :
1, 1, 3, 5, 12, 28, 74, 207, 633 ( A066951 OEIS)

[1] .
( )
(.degree, ,
.valency) ,
. -
[1]
.
( ).
G
(G) (G). . 1
. 1. ,
5, 0.
.
,
.
. ,
, . ( )
. :
, , .
( ) 410

.[2]
, . 1, (5, 3, 3, 2, 2, 1,
0). ,
.

:
.

,
(
, . 2.
). (3, 2, 2, 2, 2, 1, 1, 1).
,
- , (.graphical sequence).
, (, , 3, 3, 1)
. : ,
.
: ,
.
. ,
di ( i=1,,n)

, (3, 3, 3, 1) ;
k 1, 2 4, k 3.
-, (d1,d2,,dn)
, (d21, d31, , dd1+11, dd1+2, dd1+3, , dn)
.
.
.
,
.
,
. n-1 , .

.
( ) 411

0 .
1 (.end vertex),
(.pendant vertex) (.leaf
vertex). ,
(.terminal (pendant) edge, end-edge). . 3
{3,5}.
.
n-1 n
(.dominating vertex). . 3. 4, 5,
6, 7, 10, 11 12.

k, k-
k. k.
, 0 2
. 0 ,
.
1.
, 1.
,
(). ,
+ 1.
k- , k.

[1] , . 5
[2] , . 278

, (2005), Graph Theory (http://diestel-graph-theory.com/index.html) (3rd ed.), Berlin,
New York: Springer-Verlag, ISBN 978-3-540-26183-4.
, . & , T. (1960), " Grfok elrt fokszm pontokkal (http://www.renyi.hu/~p_erdos/
1961-05.pdf)", Matematikai Lapok .11: 264274.
, . . (1962), "On realizability of a set of integers as degrees of the vertices of a linear graph. I",
Journal of the Society for Industrial and Applied Mathematics .10: 496506.
, & , (1991), " Seven criteria for integer sequences being graphic (http://dx.
doi.org/10.1002/jgt.3190150209)", Journal of Graph Theory .15(2): 223231, DOI
10.1002/jgt.3190150209.
412

( , 1964)
, ,
.
,
" ", , " ",
.

, , . ,
.
, . ,
, , . ,
, 2 . ,
, .
, , . , ,
, ,
.

, . , G
, , ,
, G .
(Erds, Wilson 1977) , en:almost all .
, en:ErdsRnyi model, n
, , n
. n .
(Frieze, Jackson, McDiarmid, Reed 1988).

( 1965) , ,
. , ,
. ,
, ,
.
( 1965) ,
, .
(Sanders, Zhao 2001) , ,
. ,
. .
, ,
, .
413
,
3- (Tait 1880). , ,
(Appel, Haken 1976).
,
1969, , 3- ,
, ,
. en:graph
embedding, ,
, . ,
, , , ,
3- , ,
. (Kochol 2009) , , ,
, .
, , ,
, NP- .

(Misra, Gries 1992)
, . ,
,
. ,
,
.
cd-, .
. [1] , d w, ,
d, w. :
uv .
.
c , u, d , l.
cd-.
w , d w
uw d.
:
u
,
, uvk uvk+1,
.
cd- , u c
d. c d d c.
, , ,
cd- .
, ,
, n .
414
m , .
, , (Gabow, Nishizeki, Kariv, Leven 1985)
, .

, (Gutin, Toft 2000) (Soifer 2008), ,
(Shannon 1949), ,
.
, ,
.[2]

en:Brooks' theorem, .

[1]
[2] . . . .
. 1980 (, ).
1991 (http:/ / www. ams. org/ mathscinet/ search/ journaldoc. html?jc=DISKA).

K. Appel, W. HakenEvery planar map is four colorable // Bulletin of the American Mathematical Society.
1090/S0002-9904-1976-14122-5).
Paul Erds, Robin J. WilsonNote on the chromatic index of almost all graphs // Journal of Combinatorial
Theory. 1977. .23. .23. .255257. DOI: 10.1016/0095-8956(77)90039-9 (http://dx.doi.
org/10.1016/0095-8956(77)90039-9).
Jean-Claude FournierColorations des artes d'un graphe // Cahiers du Centre d'tudes de Recherche
Oprationnelle. 1973. .15. .311314..
Alan M. Frieze, B. Jackson, C. J. H. McDiarmid, B. ReedEdge-colouring random graphs // Journal of
Combinatorial Theory. 1988. .2. .45. .135149. DOI: 10.1016/0095-8956(88)90065-2
(http://dx.doi.org/10.1016/0095-8956(88)90065-2).
Harold N. Gabow, Takao Nishizeki, Oded Kariv, Daniel Leven, Osamu Terada Algorithms for edge-coloring
graphs. Tohoku University, 1985. (Tech. Report TRECIS-8501)..
Gregory Gutin, Bjarne ToftInterview with Vadim G. Vizing // European Mathematical Society Newsletter.
2000. .December. .38. P.2223..
Martin Kochol Proceedings of the American Mathematical Society. 2009. .137. .16131619..
Martin KocholComplexity of 3-edge-coloring in the class of cubic graphs with a polyhedral embedding in an
orientable surface // Discrete Applied Mathematics. 2010. .16. .158. .18561860. DOI:
10.1016/j.dam.2010.06.019 (http://dx.doi.org/10.1016/j.dam.2010.06.019).
A constructive proof of Vizing's Theorem // Information Processing Letters. 1992. .3. .41.
.131133. DOI: 10.1016/0020-0190(92)90041-S (http://dx.doi.org/10.1016/0020-0190(92)90041-S).
Daniel P. Sanders, Yue ZhaoPlanar graphs of maximum degree seven are class I // Journal of Combinatorial
1006/jctb.2001.2047).
415
Claude ShannonA theorem on coloring the lines of a network // J. Math. Physics. 1949. .28.
.148151..
Alexander SoiferThe Mathematical Coloring Book. 2008. .136137. ISBN 978-0-387-74640-1..
P.G. Tait{{{}}} // Proc. R. Soc. Edinburgh. 1880. .10. .729..
. . - // . . :
, 1964. .3. .2530..
. . // . .
: , 1965. .5. .917..

Proof of Vizing's theorem (http://planetmath.org/?op=getobj&from=objects&id=6932) at PlanetMath.

,
.
en:Robert P. Dilworth, (19141993),
.

A
. ,
.
, ( P),
,
A , ,
. .
: ,
, .
,

. ,
w , w
, .
416

(Galvin 1994).
. , .
, , .
,

. , .
,
. , . ,
. . .
. . , , .
, . , .
. , .
. .
, ,
. ,
, .
, ,
( ). ,
, .

,
(Fulkerson
1956).

S n
,
G = (U,V,E),
U = V = S (u,v) G,
u < v S.
M G,
C G,
C , M C,
m. A S, C.
A n - m ( , C ,
). P ,
x y , (x,y) M. P n - m . ,
.
417
G = (U,V,E),
G, u < v u U, v V
E u v. A P,
.
, , P .
A G , .

.

,
w , w .
, P w, ,
w . S P
w ( ) en:comparability
graph S (, S ) w .
. , P w,
, S P
w- . , en:De BruijnErds
theorem (graph theory), P w- ,
(Harzheim 2005).
,
. ,
, . ,
0,
(Harzheim 2005).
(Perles 1963) .
, ( en:Mirsky's
theorem)
, , ,
( ) ,
(Mirsky 1971). .
x , x , N(x)
x- . N1(i), ,
N, ,
.

en:comparability graph ,
.
, ,
. ,
.
418
,
.
, (Berge, Chvtal 1984).
en:perfect graph theorem (Lovsz 1972),
. , . ,
, , (Berge, Chvtal 1984).
,
.

Bn X n , {1, 2, , n}
, , , (2[n], ). en: , Bn
,
, X
X, .
en:LubellYamamotoMeshalkin inequality
.
[1,2n] , [n+1,2n]
n. n : m
[1,2n] m2i. , ,
n. en:Abouabdillah's theorem ,
.

en:order dimension (Steele 1995).
" " en:antimatroid ,
, ,
.
(Edelman, Saks 1988).

Jaroslav Neetil, Patrice Ossona de Mendez Sparsity: Graphs, Structures, and Algorithms. Heidelberg:
Springer, 2012. .28. .42. (Algorithms and Combinatorics). ISBN 978-3-642-27874-7 DOI:
10.1007/978-3-642-27875-4 (http://dx.doi.org/10.1007/978-3-642-27875-4).
Egbert Harzheim Ordered sets. New York: Springer, 2005. .7. .Theorem 5.6, p.60. (Advances in
Mathematics (Springer)). ISBN 0-387-24219-8.
Claude Berge, Vclav ChvtalTopics on Perfect Graphs. Elsevier, 1984. .21. .viii. ISBN
9780444865878.
Robert P. DilworthA Decomposition Theorem for Partially Ordered Sets // Annals of Mathematics. 1950.
Paul H. Edelman, Michael E. SaksCombinatorial representation and convex dimension of convex geometries //
Order. 1988. .1. .5. .2332. DOI: 10.1007/BF00143895 (http://dx.doi.org/10.1007/
BF00143895).
419
D. R. FulkersonNote on Dilworths decomposition theorem for partially ordered sets // Proceedings of the
American Mathematical Society. 1956. .4. .7. .701702..
Fred GalvinA proof of Dilworth's chain decomposition theorem // The American Mathematical Monthly.
1994. .4. .101. .352353. DOI: 10.2307/2975628 (http://dx.doi.org/10.2307/2975628).
Lszl LovszNormal hypergraphs and the perfect graph conjecture // Discrete Mathematics. 1972.
.2. .253267. DOI: 10.1016/0012-365X(72)90006-4 (http://dx.doi.org/10.1016/
0012-365X(72)90006-4).
Leon MirskyA dual of Dilworth's decomposition theorem // American Mathematical Monthly. 1971.
Micha A. PerlesOn Dilworth's theorem in the infinite case // Israel Journal of Mathematics. 1963. .1.
.108109. DOI: 10.1007/BF02759806 (http://dx.doi.org/10.1007/BF02759806).
J. Michael Steele Discrete Probability and Algorithms / David Aldous, Persi Diaconis, Joel Spencer, J. Michael
Steele. Springer-Verlag, 1995. .72. .111131. (IMA Volumes in Mathematics and its
Applications)..
. . , (http://www.mccme.ru/circles/oim/materials/spivak-04-2.pdf),
,
7-11.04.2004.]
Equivalence of seven major theorems in combinatorics (http://robertborgersen.info/Presentations/GS-05R-1.
pdf)
Dual of Dilworth's Theorem (http://planetmath.org/encyclopedia/DualOfDilworthsTheorem.html).
PlanetMath.
Babai, Lszl. Lecture notes in Combinatorics and Probability, Lecture 10: Perfect Graphs (http://www.classes.
cs.uchicago.edu/archive/2005/spring/37200-1/notes/10.pdf) (2005). 14 2012
(http://www.webcitation.org/67eH2q3HI).
Felsner, S., Raghavan, V., and Spinrad, J. Recognition Algorithms for Orders of Small Width and Graphs of
Small Dilworth Number (http://www.inf.fu-berlin.de/inst/pubs/tr-b-99-05.abstract.html) (1999).
14 2012 (http:/ / www. webcitation. org/ 67eH3GbHP).
Weisstein, Eric W. {{{title}}} (http://mathworld.wolfram.com/DilworthsLemma.html)(.)
Wolfram MathWorld.
() 420
()
,
1931,

. ,
1931, en:Jen
Egervry
.

( )

,
( ), .
,
.
,
. ,
.
, .
, .
,
.
, ,

,
NP- .
NP- .
, ,

NP- .
,
.
, .
. 1914
1916 , ,[1] ,
, ( ,
) [2].
.[3] (Bondy, Murty, 1976)
(1931). (Bigg)
, en:Gyula Knig.
() 421

.
:
, ,
, , ,
( "" , ).
:
, .
.
. ,
.

14 , 7 ,
. ,
,
. , ,
,
.
( ).

G=(V,E), V
L R. M
G.
"",
M. ,
|M| ,
.
M ( , M -
), |L|=|R|=|M|. G
L
R, L, R |M|
.

. M
,
M E\M. V G .
Si . ,
|M| .
S0 , M.
j 0, S2j+1 v,
() 422
1. v S2j E \ M
2. v Sk, k<2j+1.
, , Sk,
, S2j+1 .
j 1, S2j u, u M
S2j1. , v S2j1 u,
, v S0. , M
S2j1 S2j.
,
u, M v S2j1,
Si , 2j, , Si .
, .
v, S2j1 S2k k < j
, S2k
( k=0), S2k1 ( k1).
v u S2k-1 kj. , -, S2k1
k<j S2k 2k<2j1 , , v. -,
, v u S2j1. v
E\M, v S2j2, M,
S2j-3, . Si
Si1 E\M i M i .
S0, S2h+1 ,
, S2h. , u.
vu M, P. P ,
w i, ,
w, . , P
S0. P E\M, P
E\M M. , PM M P(E\M) M
, M, M.
, V Si. ,
M S2j1 S2j. , E\M
, . , E\M
S2j S2k kj. v S2k k<j, , v
E\M Si i2k+1<2j, v E\M
S2j. , , S2j
E\M . , M
E\M
. , |M| .
() 423

, ,
. ,
en:HopcroftKarp algorithm
.
,
.

en:distributed algorithm, ,
.[4]

,
. ,
, . ,
,
.
, (Lovsz 1972),
, .
2, 2 .
G G, , ,
G G. , M
G n G n-|M| , ,
, G n-|M| ,
G |M| . ,
, ,
(Gallai, 1958).
,
. G L(G) ,
G, G. , L(G)
G. G - , L(G) G,
. , ,
,
, .
,
. G G.
G, , G , - G
, . ,
, G. ,
, .
() 424

[1] , 1998 ,
Bled'07, (Harald Gropp) , 1894
.
[2] Biggs, 1976
[3] Lovsz, 1986, Theorem 1.4.17, . 37
[4] Gs, 2012

Biggs, N. L.; Lloyd, E. K.; Wilson, R. J. Graph Theory 17361936. Oxford University Press, 1976.
.203207. ISBN 0-19-853916-9
J. A. Bondy, U. S. R. Murty Graph Theory with Applications. North Holland, 1976. .74. ISBN
0-444-19451-7
Gallai, TiborMaximum-minimum Stze ber Graphen // Acta Math. Acad. Sci. Hungar.. 1958. .3-4.
Mika Gs, Jukka Suomela 26th International Symposium on Distributed Computing (DISC), Salvador, Brazil,
October 2012. 2012.
Knig, DnesGrfok s alkalmazsuk a determinnsok s a halmazok elmletre // Matematikai s
Termszettudomnyi rtest. 1916. .34. .104119.
Knig, DnesGrfok s mtrixok // Matematikai s Fizikai Lapok. 1931. .38. .116119.
Lszl Lovsz, M. D. Plummer Matching Theory. North-Holland, 1986. ISBN 0-444-87916-1
Lovsz, LszlNormal hypergraphs and the perfect graph conjecture // Discrete Mathematics. 1972.
.3. .2. .253267. DOI: 10.1016/0012-365X(72)90006-4 (http://dx.doi.org/10.1016/
0012-365X(72)90006-4)
425

.

. , , n
, 1 n,
.
n
n- (12n)
(n-1) , (
) n (n-1)
. ,

,
,
2, 3 4
0. :
2 , 3
4

.
..,
[1]: [2], [3], [4], [5].
.., [6] ,
[7]
.
A. Cayley (1889). A theorem on trees [8]. Quart. J. Math 23: 376378.
T. Ekedahl, S. Lando, M. Shapiro, A. Vainshtein. Hurwitz numbers and Hodge integrals [9].

[1] http:/ / www. mccme. ru/ dubna/ 2007/ courses/ burman. htm
[2] http:/ / www. mccme. ru/ dubna/ 2007/ notes/ burman/ Lect1. pdf
[6] http:/ / www. mccme. ru/ dubna/ 2005/ notes/ kazarian. zip
[7] http:/ / www. mccme. ru/ dubna/ 2005/ courses/ kazarian. html
[8] http:/ / books. google. com/ books?id=M7c4AAAAIAAJ& pg=PA26
[9] http:/ / arxiv. org/ abs/ math/ 9902104
426

() .
1927 ,
. 1937 ,
, ,
.

, .
. , .
.
.

.
.
, .

;
;
.
427
.
.

. , n . ,
, .
. ,
. .
0 1, .
.
.
, , .
1 .
, ,
.
, .

, .
-
( 1) ,
:
( )
428

/ . . .
.: , 1979.
/ . .. .: , 1968.
. . , . . . M.: , 1985.
. . .: , 1973.
., . . .: , 1977.
. . [1] // . 1998. .2. .21-24.

[1] http:/ / www. omsu. omskreg. ru/ vestnik/ articles/ y1998-i2/ a021/ article. html

,
,
. (.Norman Herbert Anning),
1945 .

, ,
, ,
.
, ,
. , .
, .
,
,
,
, (
). ,
.
,

.
, ,
.
429

, , , . ,
.
, , , .
. ,
, . 1 ,
,
. . ,
, .
, , ,
, ( , , ) .
, ,
. ,
,
, .
, , ,
.

Weisstein, Eric W. Erdos-Anning Theorem (http://mathworld.wolfram.com/Erdos-AnningTheorem.
html)(.) Wolfram MathWorld.
430

, , ,
.
,
.

, , , .
, 2 ? ,
, , 2 .
.

:
. , ,
, 1- ,
2- , - .
.
,
, .
.
--
, --(.):
, ,
, 1- ,
2- , , -
.
,
, , (
--).

, -
, ( ..) .[1]
, -
, .

,
, .
,
- :
431

, - .
,
.
(.) (.) 2003 .

. -, .
, ,
. -, , , ,
, .
, , . (.) US$1000
, -- . 1990. .

[1] Hales A., Jewett R. Regularity and positional games // Trans. Amer. Math. Soc. 106 (1963), p. 222229.

(http://www.ega-math.narod.ru/Nquant/Ramsey.htm)
432

( ) ,
. ,
.
. 2, 3, 4
5 .
.
7, 8, 9,... 152, 3696, 135004, ...

( A003400 OEIS)

. ,

,

,
,
.
(G) G
,
G.
T = T(G) G
,
1. T

G
2. T
.
,
6,
G, 5 (5 + 1 =6).
.
()
.
(G):
433
1. (G) (G) + 1.
2. (G) (G) + 1026. (Molloy, Reed 1998)
3. (G) (G) + 8 ln8((G)) (G). (Hind, Molloy, Reed 1998)
4. (G) ch(G) + 2.
(G) , ch(G) en:List
edge-coloring.
,
.
en:Brooks' theorem . ,

40 . .
. (en:Mehdi Behzad, )
(G) (G) + 2.
, " "
en:Mehdi Behzad 1964 1968.
(Jensen, Toft 1995) .
, ,
, 6.
, , . ,
en:List edge-coloring , (G) (G) + 3.
. , (Kilakos,
Reed 1993) , G (G)
+ 2.
:
T(G) , L(G) .

Hugh Hind, Michael Molloy, Bruce ReedTotal coloring with + poly(log) colors // SIAM Journal on
Computing. 1998. .3. .28. .816821. DOI:10.1137/S0097539795294578 [1]
Tommy R. Jensen, Bjarne Toft Graph coloring problems. New York: Wiley-Interscience, 1995. ISBN
0-471-02865-7
Kyriakos Kilakos, Bruce ReedFractionally colouring total graphs // Combinatorica. 1993. .4.
.13. .435440. DOI:10.1007/BF01303515 [2]
Michael Molloy, Bruce ReedA bound on the total chromatic number // Combinatorica. 1998. .2.
.18. .241280. DOI:10.1007/PL00009820 [3]

[1] http:/ / dx. doi. org/ 10. 1137%2FS0097539795294578
[3] http:/ / dx. doi. org/ 10. 1007%2FPL00009820
434

R X
X, , R.
R , . ,
.

R X (V, A), V =
X A = R .
. ()
().
.
, (1972),
, :

;
, ;
,
.
tred Graphviz , .

. 1987-
(J. A. La Poutr) (Jan van Leeuwen)
Maintenance Of Transitive Closures And Transitive Reductions Of Graphs (
) ,
.

O(|Enew||V|)
435

O(|Eold||V|+|Eold|2)
, Eold Enew .
, ,
O(|Eold||V|)
.

A. Aho, M. Garey, J. Ullman (June 1972). The Transitive Reduction of a Directed Graph. SIAM Journal on
Computing 1 (2): 131137. DOI: 10.1137/0201008 (http://dx.doi.org/10.1137/0201008).

Mathworld: Transitive reduction (http://mathworld.wolfram.com/TransitiveReduction.html)
., ., . . .:
, 1980, 476 .

( )

.

, .
NP- NP.
(, )
(), ,
().

()

( ) ( ).
: (
) ( ).
, ,
.
, . ,
.
436

1781[1].

[2].
.

-,
( ).
,
, .

.
: - , ,
.
- ( )

. ,
.

() .
.
:
1. , ,
.
2.
, .
.
3. , . 1,
.
437

, ,
.
(.)
.

, ,
.
.
.
. 0.
.
.
0.
(mincost maxflow).
.
. ,
, . .
mincost maxflow .
. mincost maxflow
. ( , .)
.
,
. .
, ,
.

, ,
, .
, ,
, .
, ,
.
438

,
.
.

, (
/ ).
( ).
- ( -,
).

[1] Monge G. Mmoire sur la thorie des dblais et de remblais. Histoire de lAcadmie Royale des Sciences de Paris, avec les Mmoires de
Mathmatique et de Physique pour la mme anne, pages 666704, 1781.
[2] Kantorovich L. On the translocation of masses // C. R. (Doklady) Acad. Sci. URSS (N. S.), 37:199-201, 1942.

(http://imcs.dvgu.ru/lib/nurmi/linpro/buka/node7.html)
(http://algolist.manual.ru/maths/graphs/maxflows/)
http://kb.mista.ru/article.php?id=859 1: 8.2

,
.
en:permutation graph .
, ,
, ,
. 1988
(Ido Dagan), (Martin Charles Golumbic) (Ron Pinter).
,
, .
439
. 1 .

.
,

, .

,
,
,

,
.

d , . 2 , .
.

,
x y G , x y P.
,
2.[1]
440

.
, .
, ( )
. ,
. , ,
.

x,
y .
. , RK, x y, x<y, xi
yi i=1,,k. , b b, b
b. , , .
, ,
. ,
en:sweep line algorithm.[2] 1
3.
441

.

,
Ix t1(x)
tr(x), x
, x < y
, Ix Iy
tr(x) t1(y) Ix
Iy.[3] 1993 (Langley)
,

[4]
.

. 3

.

, .
,
( , ).
, .
442

,
(Felsner) . 1993.

.

,

.
4.

.
. 4
k- .
k- .

. x . (k1)-
,
,
.

. , ,
.[5] (Dagan) .
, n
, k . ,
, ,
, .
.
, .
, ,
, .
443

, ,
. ,
, .
, .
, , , .
(McConnell)
(Spinrad) 1994 . (
2) (
2K2 ).[6] (Mertzios) (Corneil),
, ,
. ,
.

, .[7]

[1] Ido Dagan, Martin Charles Golumbic, and Ron Yair Pinter. Trapezoid graphs and their coloring. Discrete Appl. Math., 3546, 1988.
[2] Stefan Felsner, Rudolf Muller, and Lorenz Wernisch. Trapezoid graphs and generalizations, geometry and algorithms. In Algorithm
theorySWAT 94 (Aarhus, 1994), volume 824 of Lecture Notes in Comput. Sci., pages 143154. Springer, Berlin, 1994.
[3] Kenneth P. Bogart, Garth Isaak. Proper and unit bitolerance orders and graphs. Discrete Mathematics 181(13): 3751 (1998).
[4] Martin Charles Golumbic and Irith B.-A. Hartman, eds., Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications,
Springer-Verlag, New York, 2005
[5] R. McConnel and J. Spinrad, Linear-time modular decomposition and efficient transitive orientation of undirected graphs, Proc. 5. Ann.
Symp. on Discr. Alg. (1994).
[6] Golumbic, Martin Charles., and Ann N. Trenk. Tolerance Graphs. Cambridge [u.a.: Cambridge Univ., 2004.
[7] G. B. Mertzios and D. G. Corneil. Vertex splitting and the recognition of trapezoid graphs. Discrete Applied Mathematics, 159(11), pages
1131-1147, 2011.

Martin Charles Golumbic Algorithmic Graph Theory and Perfect Graphs. Academic Press, 1980. Second
edition, Annals of Discrete Mathematics 57, Elsevier, 2004.
444

,
,
.
-
.

3,
3, 1, 1 3. 2-
en:k-vertex-connected graph 2- The triangle graph = 3 = 3
en:k-edge-connected graph = 6 (D3)
= 3
= 3
= 3
=
=
2-
-
-
en:Unit
distance graph

( ) 445
( )
,

. , ,
.

(Landau) ,
.

en:social choice theory .

,
, . 4
.
:
. , ,
.

, ,
. :
, .
. - ,
.
. .
, .
, . :
en:pancyclic graph v k
k, v.[1]. , 4-,
.
( ) 446

,
, .

en:reachability.

n
:
1. T .
2. T .
3. T 3.
4. (
) T {0,1,2,...,n1}.
5. T .
8 .

, ,
. , n
. : v
v,
, , . ,
.
, , . ,
n.
, n
. en:Combinatorial proof:
k n ,

k ,
n .

, , , . ,
, . ,
1- . , T=(V,E)
k-, k- S V v0
, . en:probabilistic method
, k |V|k22kln(2+o(1)) V
k-. , , k-
( ) 447
2k+1 1 , (k + 2)2k1 1
(1965) . k- k24k1(1 +
o(1)) , , , .

en:Condensation (graph theory) . ,
,
.

. ,
.
(1953)
, :
1.
2.
3.
.
:
1, 1, 1, 2, 4, 9, 22, 59, 167, 490, 1486, 4639, 14805, 48107, ...
( A000571 OEIS)
, n
, , ,

.
,
.
( ) 448

en:Stockmeyer tournament
en:Sumner's conjecture

[1] . 1.

,
, ,
, ,
, .

en:chordless cycle .
,
.

.
() ().
. ( .
.
. .

.) .

, v, v
v, v , . ,

, (1976) (. , , , (2000)) ,
,
en:lexicographic breadth-first search.
.
, . v
, S
v S,
. ,
449
,
.
, ,
, ,
. en:graph sandwich problem NP-,
.

en:antimatroid.

.

,
NP- ( ,
). ,
, ,
v , v, ,
.
, , ,
, .
en:perfectly orderable graph
en:greedy coloring,

,
. , , .
, ,
. ,
.
,
A, S, B, AS SB
, S , , A B. , ,
.
.
450

.

,
,
. ,
.

en:tree
decomposition
. G
G
.

. ,

represented ,
.

, .
, .
, . ,
(1985) , n , n
, , .
, -en:Distance-hereditary
graph. en:Quasi-threshold graph ,
en:cograph. en:Block graph
, .
en:windmill graph,
.
en:Strongly chordal graph ,
n- (n3) .
K-en:k-tree ,
. en:Apollonian network
, , , 3-.
en:outerplanar graph 2-, .
451

.
, ,
en:even-hole-free graph. , ,
(. ).
en:strangulated graph, ,
en:peripheral cycle ,
.
en:clique-sum . ,
.

Martin Charles Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, 1980..

Information System on Graph Class Inclusions (http://www.graphclasses.org/index.html): chordal graph
(http://www.graphclasses.org/classes/gc_32.html)
Weisstein, Eric W. Chordal Graph (http://mathworld.wolfram.com/ChordalGraph.html)(.)
Wolfram MathWorld.

G ,
G ,
. (G).

,

:
3-
, ,
.
452

K- , .
, .
K- , .
, ,
.

G ,
G ,
. '(G).

. 1- .

t, ,
t.

[1]
.
, ,
, .

453
, ,

, ,
. , ,
,
1 . .
, ,
. .

.
, , , , ,
, .

[1] Birkhoff, G. D. and Lewis, D. C. Chromatic Polynomials. Trans. Amer. Math. Soc. 60, 355451, 1946.

. . . .., ... .:
, 1986.
454

,
,
,

.

:

13- .

,
.
,

en:circulant matrix.

0 n
1 , , , .

, (z x + y) mod n .
( ) ,

( ).

, .
( , 1 4) ,
0 n 1 ,
. ,
,
.
en:Mbius ladder , .
, .
, m n (,
m n ,
) . ,
{{{1}}}. ,
455

.
,
.[1]

,
2k
.
, .
, ,
.
, , n- .

,
, . ,
. ,
. en:Horst Sachs , ,
1 4,
. , ,
. 40
(Vilfred).

0 n
1 , , (z x +
y) mod n . ,
.
, c , . ax + b
. (Andrs dm)
, ,
. ,
, ,
. , , .
16- ; x 1, x 2, x 7 (
16), x 2, x 3, x 5 ( 16).
, .
456

[1] Small Ramsey Numbers (http:/ / www. combinatorics. org/ Surveys/ ds1/ sur. pdf), Stanisaw P. Radziszowski, Electronic J. Combinatorics,
dynamic survey updated 2009.

Weisstein, Eric W. Circulant Graph (http://mathworld.wolfram.com/CirculantGraph.html)(.)
Wolfram MathWorld.
( )
,
.
.

, ,
, ,
.
. ,
, .
.
.
. ,
.
. ,
. , ,
. ,
, .
,
, .
. ,
, ,
.
, ,
: ,
,
(.. ( 2
, , ), 5) (12, 2345,
, , 56).

( ) 457
,
:
1. (.. , ) ,
.
2. , , , u
, .
,
. , ,
. , 6,
. 1 , ,
. :
.
2 3, 5 6
. , 2 5 . .

. . , . . . . . . .:
. , 2006. ISBN 5-94774-543-7
( )
( , expander graph)
, , ( )[1].
, ..,
.. .. .
, .

, , ,
, .
[2].

, ,
, .
: , , .
. ,
.
, . ,
, .
( ) 458

( ) h(G) G n

S n/2 (S)
S, , S [1].

( ) G
S, ,
[3]
S . ( )
V S[4].
G
S, S,
[3]
.

G d-,
A = A(G) G, i j [1]. A
, , A n
. , [d, d].
, i = 1, , n
A, . ,
Au = du, u A 1 = d, d
G. G d2
G [1].
, n = d , G . ,
, 1 2, 1
:
.
, u,
, :
.
( ) 459

. ,
G. 1 1. ,
, .
A,
ATA.

. , d- G,
, , .

, G d- , h(G) d
2 G. , (Tanner) , , (Noga Alon)
(Vitali Milman)[5], , [1]
en:Cheeger bound
.

[3]. , 2 2(d 2)
, .

[6].
-, , ,
, - .
--
, ,
.
(Gabber) (Galil)[7]. n , Gn ,
. ,
. n Gn .
( ) 460

(Alon) (Boppana) d-
,
[1]. en:Ramanujan graph [1]
. ,

.
, (1988), (1988) (1994)
[1]. (Friedman,2003) d-
en:Random regular graph n ,
[1]
.

(
)
.
,
, en:Expander code, en:Extractor (mathematics),
, [8] .
, SLen:SL
(complexity)=Len:L (complexity)[9] PCP[10]. r
-.
, .

,
S T d- . ,
. d- ,
en:ErdsRnyi model , S T.
, E(S, T) S T. ,
,
.
[11]
,
.
(Bilu) (Linial) , , ,
[12]
.
( ) 461

en:Chernoff bound,
[1, 1],
. ,
, [13] [14], ,
. en: Randomized algorithm,
, .

[1] AMS, 2006
[2] , 2009
[3] Bobkov, 2000
[4] AlonCapalbo, 2002
[5] AlonSpencer, 2011
[6] Yehudayoff, 2012
[7] Goldreich, 2011
[8] ACM, 1983
[9] Reingold, 2008
[10] Dinur, 2007
[11] . (http:/ / www. tcs. tifr. res. in/ ~prahladh/ teaching/ 05spring/ lectures/ lec2. pdf)
[12] . (http:/ / www. cs. huji. ac. il/ ~nati/ PAPERS/ raman_lift. pdf)
[13] ACM, 1987
[14] Gillman, 1998

.., - . : , 2009.
.70122. ( , ).
Noga Alon, Joel Spencer The Probabilistic Method. 3rd. John Wiley & Sons, 2011.
Chung,FanR.K. Spectral Graph Theory. American Mathematical Society, 1997. .92. (CBMS
Regional Conference Series in Mathematics). ISBN 0-8218-0315-8
Guiliana Davidoff, Peter Sarnak, Alain Valette Elementary number theory, group theory and Ramanujan
graphs. Cambridge University Press, 2003. .55. ISBN 0-521-53143-8
Mike Krebs, Anthony Expander families and Cayley graphs: A beginner's guide. Oxford University Press,
2011. ISBN 0-19-976711-4

Alon,N.; Capalbo,M.Explicit unique-neighbor expanders // The 43rd Annual IEEE Symposium on Foundations
of Computer Science, 2002. Proceedings.. 2002. .73.
Shlomo Hoory, Nathan Linial, Avi WidgersonExpander graphs and their applications // Bulletin (New series) of
the American Mathematical Society. 2006. .4. .43. .439561. DOI:
10.1090/S0273-0979-06-01126-8 (http://dx.doi.org/10.1090/S0273-0979-06-01126-8)
BobkovS., HoudrC., TetaliP., vertex isoperimetry and concentration // Combinatorica. 2000. .2.
.20. .153172. DOI: 10.1007/s004930070018 (http://dx.doi.org/10.1007/s004930070018).
Mikls Ajtai, Jnos Komls, Endre SzemerdiProceedings of the 15th Annual ACM Symposium on Theory of
Computing. 1983. .19. ISBN 0-89791-099-0. DOI: 10.1145/800061.808726 (http://dx.doi.org/
10.1145/800061.808726)
( ) 462
M.Ajtai,J.Komls,E.SzemerdiProceedings of the 19th Annual ACM Symposium on Theory of Computing //

ACM. 1987. .132140. ISBN 0-89791-221-7. DOI: 10.1145/28395.28410 (http://dx.doi.org/10.
1145/28395.28410)
Irit DinurThe PCP theorem by gap amplification // Journal of the ACM. 2007. .3. .54. .12.
DOI: 10.1145/1236457.1236459 (http://dx.doi.org/10.1145/1236457.1236459).
D.GillmanA Chernoff Bound for Random Walks on Expander Graphs // SIAM Journal on Computing.
Society for Industrial and Applied Mathematics, 1998. .4,. .27. .12031220. DOI:
10.1137/S0097539794268765 (http://dx.doi.org/10.1137/S0097539794268765)
Oded GoldreichBasic Facts about Expander Graphs // Studies in Complexity and Cryptography. 2011.
.451464. DOI: 10.1007/978-3-642-22670-0_30 (http://dx.doi.org/10.1007/978-3-642-22670-0_30)
Omer ReingoldUndirected connectivity in log-space // Journal of the ACM. 2008. .4. .55. DOI:
10.1145/1391289.1391291 (http://dx.doi.org/10.1145/1391289.1391291)
Yehudayoff, AmirProving expansion in three steps. 2012. .3. .43. .6784. DOI:
10.1145/2421096.2421115 (http://dx.doi.org/10.1145/2421096.2421115)

Brief introduction in Notices of the American Mathematical Society (http://www.ams.org/notices/200407/
what-is.pdf)
Introductory paper by Michael Nielsen (http://michaelnielsen.org/blog/archive/notes/expander_graphs.pdf)
Lecture notes from a course on expanders (by Nati Linial and Avi Wigderson) (http://www.math.ias.edu/
~boaz/ExpanderCourse/)
Lecture notes from a course on expanders (by Prahladh Harsha) (http://ttic.uchicago.edu/~prahladh/teaching/
spring05/index.html)
Definition and application of spectral gap (http://www.yann-ollivier.org/specgraph/specgraph.html)
- 463
-
- ()
, , ,
.
, ,
. ,
.
, ,
, ( ),
,
.
.
.
, , .
, (,
, - ), ,
.
[1] [2].

[1] / .. , .. , .. [ .]. : -
, 1999. 368 . ISBN 5-7277-0253-4
[2] -
/ .. , .. , .. [ .]. : - , 2010. 200 . ISBN
978-5-7681-0523-5.
464

,

.
( )
(),
. ,
,
.
.
,
, NP-.
,
. ,
,
,

,
.

G
,
x(i) p(x(i)) < 2.
.
(.) (1952) ()
;
, , .
.
465
(1960)
.
, (:
). .
-
-(.) . G n
G (u,v) u v,
n.
, .

:
.
, ,
, .

Weisstein, Eric W. Hamiltonian Circuit [1](.) Wolfram MathWorld.
[2]
[3]
[4]

[1] http:/ / mathworld. wolfram. com/ HamiltonianCircuit. html
[2] http:/ / belsky. narod. ru/ v2/ download/ mathemat/ courses/ tgik/
[3] http:/ / compscicenter. ru/ program/ lecture/ 6623
[4] http:/ / www. refstar. ru/ data/ r/ id. 16731_1. html
466

u v T
, u v , .. .
LCA .lowest (least) common ancestor.

,
u v ,
:
LCA(u, v):
h1 := depth(u) // depth(x) = x
h2 := depth(v)
while h1 h2:
if h1 > h2:
u := parent(u)
h1 := h1 - 1
else:
v := parent(v)
h2 := h2 - 1
while u v:
u := parent(u) // parent(x) = x
v := parent(v)
return u
O(h), h . ,
, O(n) ,
(, , ).
, :
, O(n log n) O(log n)
( ). ,
, 2k k,
, .
O(n (n) + m), m .
offline-: , , .
-, O(n) O(1)
.
467

Bender M., Farach-Colton M.The LCA problem revisited [1] // Proceedings of the 4th Latin American
Symposium on Theoretical Informatics. Springer-Verlag, 2000. Vol.1776. P.88-94.
DOI:10.1007/10719839_9 [2]

- [3]

[1] http:/ / www. cs. sunysb. edu/ ~bender/ pub/ lca. ps
[2] http:/ / dx. doi. org/ 10. 1007%2F10719839_9
[3] http:/ / www. ics. uci. edu/ ~eppstein/ PADS/ LCA. py
( )
, .
, .

.
, 1
( ) 468
( )
,
,
.
- 6

G - . G
[1] ,
.
,
, . ,
, S, , ,
S. , .
,
.
, . ,
- , (
). , .
,
.
, . [2] : , ,
, . , ;
, , , , ; , ;
, , , .[3][4][5]
,

. , , (Bondy,
Murty, 1976), (Gibbons, 1985), (2005).

,
.
,
.
.
, . ,
. .
,
.
( ) 469

, .
, .
, ,
. , .
( ).
.
.

[1] , 2008, 2.1 , , . 34-38
[2] , 1977, , . 37
[3] , 2003, , . 232
[4] , 2003, ., . 232
[5] , 1978, 1. 2. , . 13

en:Cycle space
en:Caterpillar tree

Pathwidth:Path decomposition

. . .: , 2003. 300. ISBN 5-354-00301-6
, . .: , 2008. 352. ISBN 978-5-397-00044-4
. . . 2-.. .: <<>>, 1978.
. . .: <<>>, 1977. ( .
).
J.A. Bondy, U.S.R. Murty Graph Theory with Applications. North Holland, 1976. .1221. ISBN
0-444-19451-7
. : - - , 2002. ISBN 5-86134-101-
Gibbons, A. Algorithmic Graph Theory. Cambridge University Press, 1985. .56. ISBN
0-521-28881-9
Bernhard Korte, Lszl Lovsz, Hans Jrgen Prmel Alexander Schrijver Paths, Flows, and VLSI-Layout.
Algorithms and Combinatorics 9, Springer-Verlag, 1990. ISBN 0-387-52685-4
( ) 470

Weisstein, Eric W. Path Graph (http://mathworld.wolfram.com/PathGraph.html)(.) Wolfram
MathWorld.

( ) ,
. (.
)
, .
, .
, ().
.
,
.
/
,
.

, ,
,
.
,
.[1][2]
,
.
, .
, .
, .

.

,
, , .

. ,
, , . 2
. , ,
, . (, ),
.
471

, , .
, ( ).
, .
, .
, , , :
procedure find_all_cycles (v)

var cycles
1. , v,
cycles ( )

2. cycles
cycles[i]
: find_all_cycles (cycles[i])
, ,
.
1 .
O(M),
.

[1] (http:/ / www. msclub. ce. cctpu. edu. ru/ bibl/ ODM/ Ll2_5. html)
[2] . , . , " ", 2 ", , " (http:/ / www. intuit. ru/ studies/
courses/ 101/ 101/ lecture/ 1550?page=3): // ., 27.09.2006

( C++) (http://e-maxx.ru/
algo/euler_path)
codenet.ru (http://sources.codenet.ru/download/936/
graph3.html)
(http://belsky.narod.ru/v2/download/mathemat/courses/tgik/)
. ( : , ) (http://rain.
ifmo.ru/cat/view.php/vis/graph-circuits-cuts)
. . (http://golovolomka.hobby.ru/books/gik/index.shtml) -
(http://golovolomka.hobby.ru/books/gik/02.shtml)
Weisstein, Eric W. Eulerian Circuit (http://mathworld.wolfram.com/EulerianCircuit.html)(.)
Wolfram MathWorld.
472

() : http://ru.wikipedia.org/w/index.php?oldid=61221387 : ASSH, AVRS, Abyr, Acrobat, Agor153, Aldanur, Alex Kapranoff, Alexandrov, Amoses,
Andronniy, AntonR, Arachn0, Art-Roman, Avosco, Bepa, BeteTest, Bff, Bierce, Captain, DaKick, Dark-oneof, Dims, Doff, EmbargEr, Enzet, FBI, Fdsc, Fibonachi, Fifis, Formulac4, Fractaler,
Incnis Mrsi, Infovarius, Irina Gelbukh, Krassotkin, LaserJet, Les, Leshabirukov, Lew Wadoo, Lvova, MPI3, MRids, Maestro, ManN, Mashiah Davidson, Maxim Razin, Mogul82, Musinik,
NovaCxarmulo, Ob ivan, Obakeneko, Oleg R, Patro.macro, Phoenix, Prijutme4ty, Qkowlew, Ramir, Rmn, Sir sigurd, Snch, Solver55, Sovetnik, Stannic, Swappp, Tosha, Unomano, Viz,
Void-995, Volodymyr Obrizan, Wesha, Woo, X7q, Ysoldak, Zorgit, , , , , , 142
: http://ru.wikipedia.org/w/index.php?oldid=61997864 : A.I., AKA MBG, Abyr, Agor153, Alex Smotrov, AlexAvramenko, Alexandrov, Amoses,
Andrew Stankevich, AntonR, Artemka373, Avosco, Baz-Wiki, Baz.77.243.99.32, Bums, Cveto4ek001, D1gital love, Doff, Evatutin, Exlex, Fractaler, Gric Art, Incnis Mrsi, Jaro.p, Jinma, Kitaets,
Kobanov, Kuzmaka, LeoZub, Leshabirukov, Loveless, MPI3, Marcuch, Maximaximax, Mhym, Mir76, Mkp, NickShaforostoff, Nickst, Obersachse, Pavlovskteam, RainbowUnicorn, Ramir,
Rogalik, Serge314, Sergey539, Shlakoblock, Singa, Softy, Speakus, Splux, Tim2, Toto, Tyahti, UNV, User101, Vasiliev Mihail, VladimirReshetnikov, Woo, X7q, XJaM, Ysoldak, Zboris,
, ., , , , , 80
: http://ru.wikipedia.org/w/index.php?oldid=62009129 : Dnikitin, MPI3, NovaCxarmulo, Rasim, Woo, , , 9

: http://ru.wikipedia.org/w/index.php?oldid=59994650 : A5b, Atorero, Dulat K, ManN, Maxal, Obersachse, Peni, Pnzrusher, Stannic,
Stassats, X7q, Zimin.V.G., , 5
: http://ru.wikipedia.org/w/index.php?oldid=61084808 : A Veselova, AKA MBG, AdmiralHood, Ahtoh, Amoses, Anton Khorev, Avosco,
Azh7, Bandar Lego, Bepa, BeteTest, Bezik, Buenasdiaz, Csman, Diimdeep, Dims, Doff, Drugov, ESSch, Evatutin, FHen, Fat763, Flym, Fractaler, George142, Glaue2dk, Gribozavr, Incnis Mrsi,
Jumpow, LEMeZza, Leonius, Les, Leshabirukov, Mashiah Davidson, Maxal, Mercury, Mikhail Dvorkin, Niketas, NovaCxarmulo, Nutus, Pascal65536, Peni, Pnzrusher, Prijutme4ty, Ramir,
SashokA, Sim3331621, Sirozha, Softy, Stannic, Tauraloke, Termar, Tim2, Torin, Tosha, Vguzev, Woo, X7q, 1e0nid, , ., , , , ,
, , , 100
Graphviz : http://ru.wikipedia.org/w/index.php?oldid=60840421 : AVRS, Anihilator, Deepak-nsk, DenisKrivosheev, Enzet, Grey horse, Gruzd, Krassotkin,
NickShaforostoff, Pavel Zubkov, Polonair, Quicktotal, Stas, Stassats, Vlad2000Plus, Wikidrakon, X7q, , 7
Haus vom Nikolaus : http://ru.wikipedia.org/w/index.php?oldid=53430435 : AVRS, Fractaler, Golden Bell
: http://ru.wikipedia.org/w/index.php?oldid=59687344 : Danneks, DerLetzteRegenbogen, Grey horse, Ilvil, Ilya Voyager, Infovarius, Iponomarev,
Javalenok, Leshabirukov, Michaello, Mousy, Robiteria, Sonic86, Spectorsky, Tosha, Valentinovna, Xion, , 22, 2
: http://ru.wikipedia.org/w/index.php?oldid=53717848 : Bezik, Gerich home, Structor, , , 2

: http://ru.wikipedia.org/w/index.php?oldid=57227491 : AKA MBG, MineDater, Okras,
: http://ru.wikipedia.org/w/index.php?oldid=60780454 : Jumpow, 1
: http://ru.wikipedia.org/w/index.php?oldid=53743887 : Oleg Kenunen, Structor, Vanjka-ivanych, X7q, 1
: http://ru.wikipedia.org/w/index.php?oldid=61290088 : Danneks, Jumpow, Softy
( ) : http://ru.wikipedia.org/w/index.php?oldid=61149262 : Jumpow
k- : http://ru.wikipedia.org/w/index.php?oldid=59836357 : Jumpow
- : http://ru.wikipedia.org/w/index.php?oldid=60470747 : Jumpow, VAP+VYK
: http://ru.wikipedia.org/w/index.php?oldid=43376731 : AKA MBG, Ahtoh, Amoses, Anton Khorev, Avosco, Azh7, Bandar Lego, Bepa, BeteTest,
Bezik, Buenasdiaz, Csman, Dims, Doff, Drugov, ESSch, Evatutin, FHen, Fat763, Flym, Fractaler, George142, Glaue2dk, Gribozavr, Incnis Mrsi, LEMeZza, Leonius, Les, Leshabirukov, Mashiah
Davidson, Mikhail Dvorkin, Niketas, NovaCxarmulo, Nutus, Pascal65536, Peni, Pnzrusher, Prijutme4ty, Ramir, SashokA, Sim3331621, Softy, Tauraloke, Termar, Tim2, Torin, Tosha, Vguzev,
Woo, X7q, 1e0nid, , , , , , 91
: http://ru.wikipedia.org/w/index.php?oldid=61877121 : A5b, AKA MBG, Asjudc, Enzet, Petrov Victor, Softy, Tazolotuhin,
VladimirReshetnikov, Void-995, 5
, () : http://ru.wikipedia.org/w/index.php?oldid=61621945 : Jumpow, VAP+VYK
: http://ru.wikipedia.org/w/index.php?oldid=61182445 : Dulat K, Jumpow
: http://ru.wikipedia.org/w/index.php?oldid=53346510 : Infovarius, ManN, Mashiah Davidson, Maxal, OckhamTheFox, Rishelie, Tosha,

, , , 10
: http://ru.wikipedia.org/w/index.php?oldid=59314449 : Ali Shadow, Alik Kirillovich, Brolny, DenisKrivosheev, Evatutin, FHen, Infovarius, LEMeZza,
Loveless, Maksim-e, 5
: http://ru.wikipedia.org/w/index.php?oldid=61853226 : Jumpow
: http://ru.wikipedia.org/w/index.php?oldid=59721624 : Alex Smotrov, Deevrod, Infovarius, 12, 7
: http://ru.wikipedia.org/w/index.php?oldid=59485061 : Arbnos, Egor-belikov, Jumpow, Stannic
: http://ru.wikipedia.org/w/index.php?oldid=58143304 : Arbnos, Bezik, Jumpow, Robiteria, WebCite Archiver, ,

, 2
: http://ru.wikipedia.org/w/index.php?oldid=61621903 : Dulat K, Jumpow, VAP+VYK, 1
: http://ru.wikipedia.org/w/index.php?oldid=61166547 : Danneks, Jumpow
: http://ru.wikipedia.org/w/index.php?oldid=57569928 : Aserebrenik, Bezik, Stannic, Zemliakov, , 3
: http://ru.wikipedia.org/w/index.php?oldid=61622019 : Jumpow, Shogiru

473
: http://ru.wikipedia.org/w/index.php?oldid=60179857 : Danneks, Jumpow, VAP+VYK
: http://ru.wikipedia.org/w/index.php?oldid=61563254 : Jumpow, VAP+VYK
: http://ru.wikipedia.org/w/index.php?oldid=60326078 : AKA MBG, Oxipetrina, Tema Timonin
: http://ru.wikipedia.org/w/index.php?oldid=61812725 : Bezik, Danneks, Jumpow
: http://ru.wikipedia.org/w/index.php?oldid=61621823 : Jumpow, Simulacrum
: http://ru.wikipedia.org/w/index.php?oldid=53457220 : Aspid812, Lockal, Vald, Wikiedit2012, 6
: http://ru.wikipedia.org/w/index.php?oldid=61621796 : Jumpow, Sozertsatel
: http://ru.wikipedia.org/w/index.php?oldid=61290568 : Danneks, Jumpow, WebCite Archiver
: http://ru.wikipedia.org/w/index.php?oldid=59642619 : Alexandrov, Fractaler, Infovarius, Jumpow, Les, Leshabirukov, Mousy, , 1

: http://ru.wikipedia.org/w/index.php?oldid=60721734 : AlexVinS, FcxSanya, Infovarius, Lvova, Màidez, Softy, Vort, Wikiedit2012,

, , , , 7
: http://ru.wikipedia.org/w/index.php?oldid=60886072 : Jumpow, Tatewaki
: http://ru.wikipedia.org/w/index.php?oldid=53435433 : Arbnos, Irina Gelbukh, , 1
: http://ru.wikipedia.org/w/index.php?oldid=61816988 : Bezik, Danneks, Jumpow
: http://ru.wikipedia.org/w/index.php?oldid=61968188 : Byzantine, Danneks, Jumpow
- : http://ru.wikipedia.org/w/index.php?oldid=55160332 : 4th-otaku, A5b, Evatutin, WebCite Archiver, 1
- : http://ru.wikipedia.org/w/index.php?oldid=61797225 : Jumpow, OneLittleMouse, ., 8
: http://ru.wikipedia.org/w/index.php?oldid=60671218 : Jumpow, LEMeZza
: http://ru.wikipedia.org/w/index.php?oldid=59209075 : AKA MBG, Fractaler, Infovarius, Koterpillar, Peni, Tucvbif, Valdis72, X7q, ,
, 11
: http://ru.wikipedia.org/w/index.php?oldid=60715927 : AKA MBG, Cheops, DAFTc0d3r, Demdim, Dluciv, Dodonov, HAL9000, Mercury, Mikhail
Dvorkin, Rasim, W2, X7q, , 18
( ) : http://ru.wikipedia.org/w/index.php?oldid=61147615 : AVB, Abatishchev, Aganoob, Alex Smotrov, Burivykh, Consigliere, D1gital love,
Demdim, Dimanovs, Evatutin, FHen, Fractaler, Greck, HAL9000, Halyavin, Ivanhoe, Jumpow, Maksim-e, Maximaximax, Petrohan, Pk boot, Rokur, Serebr, Termar, Tigga, Tookser, Toothless,
Tosha, Tutaishy, Udalov, Volkov, Vovkarak, X7q, , , , ( ), , , , , 56

: http://ru.wikipedia.org/w/index.php?oldid=53695551 : Tauraloke, 1
- : http://ru.wikipedia.org/w/index.php?oldid=60580990 : IGW, Jumpow
- : http://ru.wikipedia.org/w/index.php?oldid=61808781 : Bezik, IGW, Jumpow, UncleMartin
( ) : http://ru.wikipedia.org/w/index.php?oldid=59622102 : Bezik, Zemliakov, , 1
: http://ru.wikipedia.org/w/index.php?oldid=60886038 : Jumpow, , , 1
: http://ru.wikipedia.org/w/index.php?oldid=61867313 : 3ulk, Alex Kapranoff, Alex hor, Alexeytuzhilin, Alpunin, Amoses, Andre Engels,
AntonR, Cryptomancer, Daniel Karapetyan, Drakosh, Fractaler, Grebenkov, Halyavin, Indy256, Kit, MPI3, Maximaximax, Metkere, Qwaker, Sergey539, Stannic, Vaprycko, W2, X7q, Zoom82,
, 1967, , , , , 47
: http://ru.wikipedia.org/w/index.php?oldid=55389807 : AVB, Andrew Stankevich, Bosik GN, Eleferen, Fractaler, Loveless, Mask.ua,
Ricardo Ferreira de Oliveira, Sizikov Anton, , , , 12
: http://ru.wikipedia.org/w/index.php?oldid=53537169 : Andrew Stankevich, Enzet, FelixTheRat, Fractaler, Maxal, Mousy, Prijutme4ty, Tyahti, X7q,
, 11
: http://ru.wikipedia.org/w/index.php?oldid=59711194 : A5b, FelixTheRat, Fractaler, IGW, Igoresp, Jumpow, Maxal,

OneLittleMouse, Stannic, Tyahti, VAP+VYK, -11 , 11
: http://ru.wikipedia.org/w/index.php?oldid=59132075 : Alexeytuzhilin, Maxal, Sergey539, Tosha, VAP+VYK, Vasssya, X7q, 8
: http://ru.wikipedia.org/w/index.php?oldid=59375202 : Chath, Dionys, Flash alexey, Loveless, Maximaximax, Rasim, , ,

, , 13
474
- : http://ru.wikipedia.org/w/index.php?oldid=58996162 : Danneks, Dulat K, Jumpow
: http://ru.wikipedia.org/w/index.php?oldid=61203617 : Bezik, Solodkind, , 4
: http://ru.wikipedia.org/w/index.php?oldid=58706074 : Evatutin, Igor Yalovecky, Jumpow, Maxal, Tim2, 5
: http://ru.wikipedia.org/w/index.php?oldid=59815655 : Bezik, Evatutin, Jumpow, Maxal, Tim2, VAP+VYK, Zolumov, 2
: http://ru.wikipedia.org/w/index.php?oldid=60612012 : Bezik, Dstary, Dulat K, Jumpow, VAP+VYK
( ) : http://ru.wikipedia.org/w/index.php?oldid=60449249 : Cheops, Infovarius, Jumpow, Les, Leshabirukov, Njarlatotep, Tretyak, 5

( ) : http://ru.wikipedia.org/w/index.php?oldid=61081265 : Consigliere, Fractaler, Jumpow, Pastafarianist, RayIG, Stannic, Vd437, X7q, Yatur,
, 9
: http://ru.wikipedia.org/w/index.php?oldid=55455450 : Bezik, Dimka Dim, , , 1
( ) : http://ru.wikipedia.org/w/index.php?oldid=61290200 : Danneks, Jumpow
: http://ru.wikipedia.org/w/index.php?oldid=53650538 : Chath, Igorkan, Lynx607, Robiteria, Structor, X7q, , , 5

: http://ru.wikipedia.org/w/index.php?oldid=55775679 : A5b, AKA MBG, Igor Yalovecky, Lvova, Mashiah Davidson, Oyster, Rasim,
Stassats, , , 6
: http://ru.wikipedia.org/w/index.php?oldid=51409089 : AVRS, Baz.77.243.99.32, Elek, Evatutin, Fibonachi, HarDNox, Inc ru, Longbowman,
Maksim-e, Massarkasch, Maxal, Meltsers, Niksab, Putnik, Riping, Sanya3, Starless, Tim2, Valdis72, , 16
( ) : http://ru.wikipedia.org/w/index.php?oldid=58031353 : Jumpow, MPI3,
( ) : http://ru.wikipedia.org/w/index.php?oldid=60927868 : Danneks, Jumpow
: http://ru.wikipedia.org/w/index.php?oldid=21744111 : A5b, Glaue2dk, Rasim, 3
: http://ru.wikipedia.org/w/index.php?oldid=62065017 : Bezik, Jumpow, Sozertsatel, WebCite Archiver
: http://ru.wikipedia.org/w/index.php?oldid=60663324 : Jumpow, Sim3331621, Valdis72, X7q, 1
: http://ru.wikipedia.org/w/index.php?oldid=61148895 : VictJava, , 4
: http://ru.wikipedia.org/w/index.php?oldid=30829701 : Andead iv, Rasim, SergeyRock, X7q, , 6
: http://ru.wikipedia.org/w/index.php?oldid=60823310 : Freezeman, Magikwood, Miphreal, Qkowlew, Stannic, Structor, X7q, ,

, 17
: http://ru.wikipedia.org/w/index.php?oldid=59994612 : Infovarius, Magin, Maxal, Pnzrusher, X7q, 1
: http://ru.wikipedia.org/w/index.php?oldid=60730004 : G0rn, Magikwood, Master Shadow, Redricshuhart, Ricin, Stannic, Valdis72, X7q,
, 21
() : http://ru.wikipedia.org/w/index.php?oldid=61645069 : AKA MBG, Jumpow, Schulllz, Schullz, Team4D.Stels, Uragan. TT, VAP+VYK
: http://ru.wikipedia.org/w/index.php?oldid=56249096 : Gradmir, Lynx607, NBS, VZakharov, , , 8

: http://ru.wikipedia.org/w/index.php?oldid=59990788 : Baz.77.243.99.32, Golart, Massarkasch, Niksab, Putnik, RedAndr, Starless, Tim2, ,

1
( ) : http://ru.wikipedia.org/w/index.php?oldid=61622040 : Jumpow, Mercury
: http://ru.wikipedia.org/w/index.php?oldid=60587559 : Jumpow, Leonius, Maximaximax, Pnzrusher, Tosha, 1
: http://ru.wikipedia.org/w/index.php?oldid=61968047 : Byzantine, Jumpow,
: http://ru.wikipedia.org/w/index.php?oldid=54989426 : Andrijko Z., Cantor, Carn, DenisKrivosheev, ESSch, Incnis Mrsi, Not
Tupik, Obersachse, ShinePhantom, Vladimir Solovjev, Vladimir-saliy, X7q, , , , 4
: http://ru.wikipedia.org/w/index.php?oldid=61937712 : Bezik, Jumpow
: http://ru.wikipedia.org/w/index.php?oldid=57749859 : Cheops, Crabiki, Daniel Karapetyan, MPI3, ,

( ) : http://ru.wikipedia.org/w/index.php?oldid=61808578 : Bezik, Danneks, Jumpow, VAP+VYK
: http://ru.wikipedia.org/w/index.php?oldid=60658730 : AdmiralHood
: http://ru.wikipedia.org/w/index.php?oldid=57569871 : 4th-otaku, Ante, DenisKrivosheev, Fractaler, Free.enchant, Infovarius, Longbowman,

Loveless, Obersachse, Stannic, WillNess, , , , , 9
( ) : http://ru.wikipedia.org/w/index.php?oldid=60542222 : Jumpow, Stannic

475
: http://ru.wikipedia.org/w/index.php?oldid=60633767 : Amoses, Anton Khorev, Artem Korzhimanov, Bosik GN, DenisKrivosheev,

DonAvero, Greck, Halyavin, Leshabirukov, Mackseem, Maestro, Michaello, Ramir, Tucvbif, Voropz, X7q, , 20
: http://ru.wikipedia.org/w/index.php?oldid=57568566 : A5b, Andronniy, BattlePeasant, Bezik, Oyster, Stannic, X7q, , 10

: http://ru.wikipedia.org/w/index.php?oldid=61977758 : Demdim, ErmakBrun, Evatutin, Jumpow, Nokta strigo, VAP+VYK, Voroninv, 13

: http://ru.wikipedia.org/w/index.php?oldid=60658600 : AdmiralHood
: http://ru.wikipedia.org/w/index.php?oldid=58787594 : A5b, AdmiralHood, Das steinerne Herz, Denton, Fractaler, George142, Hat600, In digma,
Infovarius, Krab8nog, Kv75, Les, Leshabirukov, Mercury, Mhym, Njarlatotep, Pnzrusher, Popoffka, ShinePhantom, Shlakoblock, Urod, VladimirReshetnikov, X7q, .., 21

: http://ru.wikipedia.org/w/index.php?oldid=61289688 : Anton Khorev, Danneks, Fractaler, Fuxx, Infovarius, Jumpow, Ramzysamman, 2

: http://ru.wikipedia.org/w/index.php?oldid=61436783 : Jumpow, , 1
Woo, X7q, 1e0nid, , , , , , 91
: http://ru.wikipedia.org/w/index.php?oldid=53542539 : Alex Tsvetkov, Assaron, Indy256, Urod, X7q, ,

, , 2
: http://ru.wikipedia.org/w/index.php?oldid=39646126 : Incnis Mrsi, Rasim, Shattered, , 2
: http://ru.wikipedia.org/w/index.php?oldid=32964847 : Dmitry89, Exxxxxcel, Felitsata, Gvozdik, Ivan A. Krestinin,

Jumpow, Leonius, Letzte*Spieler, Pavel.nps, Samal, Tpyvvikky, WebCite Archiver, 3
: http://ru.wikipedia.org/w/index.php?oldid=59875518 : Dmitry89, Exxxxxcel, Felitsata, Gvozdik, Ivan A. Krestinin,

Jumpow, Leonius, Letzte*Spieler, Pavel.nps, Samal, Tpyvvikky, WebCite Archiver, 3
: http://ru.wikipedia.org/w/index.php?oldid=60089349 : Ain92, Alex Smotrov, Beaumain, Fractaler, Infovarius, Le Traceur

Snork, Mark Ekimov, Obersachse, Ortem, Schetnikova Anna, X7q, 19
Woo, X7q, 1e0nid, , , , , , 91
: http://ru.wikipedia.org/w/index.php?oldid=61049268 : Angstorm, Artem M. Pelenitsyn, Blacklake, Burzuchius, Deformer, Dstary, Fractaler, Frato, Gaz v
pol, Infovarius, Loveless, Mikhail Dvorkin, Newred, Night man, Puzzler, Q Valda, Stannic, WebCite Archiver, Yms, , , , 52
: http://ru.wikipedia.org/w/index.php?oldid=53755457 : Be nt all, Evatutin, Infovarius, Rambalac, 2
: http://ru.wikipedia.org/w/index.php?oldid=14985168 : A5b, Animist, FearChild, Glaue2dk
: http://ru.wikipedia.org/w/index.php?oldid=53283711 : Abyr, Melancholic, Mhym, Oyster, Peni, Siriuz, , 6
: http://ru.wikipedia.org/w/index.php?oldid=61876736 : Esp, Gafusss, Gizzatullin, Jumpow, Neon, Softy, VAP+VYK, Vertaler, Voldemar24,
, , , , 31
( ) : http://ru.wikipedia.org/w/index.php?oldid=61285311 : Danneks, Jumpow, VAP+VYK
: http://ru.wikipedia.org/w/index.php?oldid=61859549 : IGW, Jumpow, Onoda, VAP+VYK, ., 3
k- : http://ru.wikipedia.org/w/index.php?oldid=60601781 : Jumpow, 1
- : http://ru.wikipedia.org/w/index.php?oldid=61429199 : Adavyd, Jumpow
: http://ru.wikipedia.org/w/index.php?oldid=60927840 : Dulat K, Jumpow, VAP+VYK
( ) : http://ru.wikipedia.org/w/index.php?oldid=61134765 : Jumpow, Sozertsatel
: http://ru.wikipedia.org/w/index.php?oldid=61076066 : Jumpow, Sozertsatel
: http://ru.wikipedia.org/w/index.php?oldid=61272348 : Cveto4ek001, Sir sigurd, , 5
: http://ru.wikipedia.org/w/index.php?oldid=53284356 : A5b, Artemka373, Mashiah Davidson, Oyster, Valdis72, X7q, , , 10

: http://ru.wikipedia.org/w/index.php?oldid=60223978 : AVB, Afanasovich, Bodia1406, Chath, Denjs, Forajump, Infovarius, Mercury, Nashev,
Rubin16, SergNiko, Small Bug, , , 15
: http://ru.wikipedia.org/w/index.php?oldid=61808642 : Bezik, Jumpow
: http://ru.wikipedia.org/w/index.php?oldid=60961753 : AKA MBG, Ant, DeC, Jumpow, Kalendar, Katpyxa, Maxal, Rasim, Rishelie, ,

476
: http://ru.wikipedia.org/w/index.php?oldid=61870872 : Gipoza, Jumpow
: http://ru.wikipedia.org/w/index.php?oldid=61815694 : FREL98, Jumpow, VAP+VYK
: http://ru.wikipedia.org/w/index.php?oldid=61239414 : AKA MBG, AVRS, Andreykh, Festys, Ghuron, Jermy, Moshanin, Tema Timonin,
!, 3
( ) : http://ru.wikipedia.org/w/index.php?oldid=55946976 : Bezik, Bondaruk85, StanTRC, , 12, 2

: http://ru.wikipedia.org/w/index.php?oldid=60739142 : AJZ, Ace111, Bezik, Gedeon Spilet, Jumpow, Kadanuumuu, Lazyhawk, Obersachse,
VictJava, WebCite Archiver, , 4
() : http://ru.wikipedia.org/w/index.php?oldid=60038125 : A5b, Abyr, Infovarius, Jumpow, Rasim, Stannic, Tosha, Tretyak, 3

: http://ru.wikipedia.org/w/index.php?oldid=53749141 : Burivykh, Tretyak
: http://ru.wikipedia.org/w/index.php?oldid=61014631 : CodeMonk, Danneks, Massarkasch, Maxal, Michaello, Mousy, Starless, Stassats,

Tosha, VictJava, 1
: http://ru.wikipedia.org/w/index.php?oldid=53430674 : Bezik, Jumpow, Robiteria, 12, 1
: http://ru.wikipedia.org/w/index.php?oldid=61772102 : Deevrod, Demdim, INS Pirat, KleverI, Maxal, Miomache, Mutari-Dirk, Stannic, Syarik,
VladimirReshetnikov, 12, 5
: http://ru.wikipedia.org/w/index.php?oldid=56113543 : Dims, Hikin1987, Maxal, Rasim, 1
: http://ru.wikipedia.org/w/index.php?oldid=53988747 : Altes, Bezik, Jumpow, WebCite Archiver, 1
: http://ru.wikipedia.org/w/index.php?oldid=59866901 : Alex hor, Alt-sysrq, Baz.77.243.99.32, Brateevsky, Cand, Dimka77777, El-chupanebrej,

Gruznov, Igor Vakula, Inc ru, Infovarius, Jumpow, Karulana, KleverI, Nickst, Pessimist2006, Splux, WindEwriX, X7q, c11, , , ,
, , 20, 41
: http://ru.wikipedia.org/w/index.php?oldid=61244639 : Danneks, IvanBliznets, Jumpow, VAP+VYK,
: http://ru.wikipedia.org/w/index.php?oldid=59642647 : Animist, Const st, EmbargEr, Evatutin, Fractaler, Infovarius, Jumpow, Koko90, Leonius,
Leshabirukov, Pnzrusher, Tosha, Victor-435, X7q, 1e0nid, 12, 15
( ) : http://ru.wikipedia.org/w/index.php?oldid=56645914 : Nutus, Schekinov Alexey Victorovich, , 1
( ) : http://ru.wikipedia.org/w/index.php?oldid=61484511 : Dulat K, Jumpow, Stannic, VAP+VYK, 2
- : http://ru.wikipedia.org/w/index.php?oldid=30028033 : 4th-otaku, A5b, Abyr, ESSch, Evatutin, Glaue2dk, Mashiah Davidson,

Rokur, ShurShur, Zoe, 1
: http://ru.wikipedia.org/w/index.php?oldid=59993003 : Aikr, Amcour, Fractaler, Holop, Infovarius, Lockal, Loveless, Maxal, NBS, NiconNeo,
NovaCxarmulo, Obersachse, Pankdm, Pastafarianist, Pilo4ka, Sivanov87, SkliF, Smylic, Stannic, Toto, User101, X7q, YuSh, Zorgit, , ., , , 13

: http://ru.wikipedia.org/w/index.php?oldid=59059255 : Halyavin, Stannic, X7q, , , , 4

( ) : http://ru.wikipedia.org/w/index.php?oldid=57568758 : LEMeZza, Stannic, Torvin, Tretyak, U.Steele, Zstomp, 1
( ) : http://ru.wikipedia.org/w/index.php?oldid=61852175 : A5b, Aced, Cyr, Fractaler, Glaue2dk, Infovarius, Jumpow, Stalker1, Stannic,
WindEwriX, 0, 8
: http://ru.wikipedia.org/w/index.php?oldid=60704048 : A5b, AVB, Claymore, Evatutin, Exprmntr, FearChild, Fractaler, G0rn, Ilya Voyager, Infovarius,
Leper Messiah, Loveless, NBS, NRozina, Nickst, NovaCxarmulo, Obersachse, Stalker1, Stannic, Termar, W2, X7q, YuSh, , , , , ,
34
, 477
,

:Sample graph.svg : http://ru.wikipedia.org/w/index.php?title=:Sample_graph.svg : Creative Commons Attribution-Share Alike : Acrobat
:Undirected.svg : http://ru.wikipedia.org/w/index.php?title=:Undirected.svg : Public Domain : JMCC1, Josette, Kilom691, 2
:Directed.svg : http://ru.wikipedia.org/w/index.php?title=:Directed.svg : Public Domain : Grafite, Jcb, Josette, 2
:6n-graf.svg : http://ru.wikipedia.org/w/index.php?title=:6n-graf.svg : Public Domain : User:AzaToth
:GraphvizLogo.png : http://ru.wikipedia.org/w/index.php?title=:GraphvizLogo.png : : DenisKrivosheev
:UnitedStatesGraphViz.svg : http://ru.wikipedia.org/w/index.php?title=:UnitedStatesGraphViz.svg : Public domain : Conti, Keenan Pepper, Super
Rad!
:Briefumschlag fcm.jpg : http://ru.wikipedia.org/w/index.php?title=:Briefumschlag_fcm.jpg : Creative Commons Attribution-Sharealike 2.5 : ,
Baden-Baden
:Asymmetric tree.svg : http://ru.wikipedia.org/w/index.php?title=:Asymmetric_tree.svg : Creative Commons Attribution-Sharealike 3.0 :
Leshabirukov
:Asymmetric graph.svg : http://ru.wikipedia.org/w/index.php?title=:Asymmetric_graph.svg : Creative Commons Attribution-Sharealike 3.0 :
Leshabirukov
:can_73_rcm.pdf : http://ru.wikipedia.org/w/index.php?title=:Can_73_rcm.pdf : Creative Commons Attribution-Sharealike 3.0 : User:Ysaad us
File: .png : http://ru.wikipedia.org/w/index.php?title=:__.png : Creative Commons
Attribution-Sharealike 3.0 : User:MineDater
File: .png : http://ru.wikipedia.org/w/index.php?title=:__.png : Creative Commons Attribution-Sharealike
3.0 : User:MineDater
File: .png : http://ru.wikipedia.org/w/index.php?title=:___.png : Creative
Commons Attribution-Sharealike 3.0 : User:MineDater
Image:Acyclic coloring.svg : http://ru.wikipedia.org/w/index.php?title=:Acyclic_coloring.svg : Creative Commons Attribution 2.5 : Claudio Rocchini
:Moser spindle pseudotriangulation.svg : http://ru.wikipedia.org/w/index.php?title=:Moser_spindle_pseudotriangulation.svg : Creative Commons Zero
: David Eppstein
File:Hadwiger-Nelson.svg : http://ru.wikipedia.org/w/index.php?title=:Hadwiger-Nelson.svg : Public Domain : David Eppstein
File:Hajos construction.svg : http://ru.wikipedia.org/w/index.php?title=:Hajos_construction.svg : Creative Commons Zero : David Eppstein
:TruncatedTetrahedron.gif : http://ru.wikipedia.org/w/index.php?title=:TruncatedTetrahedron.gif : Public domain : Radagast3
:Grid separator.svg : http://ru.wikipedia.org/w/index.php?title=:Grid_separator.svg : Public Domain : David Eppstein
:Centered tree.gif : http://ru.wikipedia.org/w/index.php?title=:Centered_tree.gif : Creative Commons Attribution 2.5 : Claudio Rocchini
: .svg : http://ru.wikipedia.org/w/index.php?title=:__.svg : Public Domain
: Enzet
: .svg : http://ru.wikipedia.org/w/index.php?title=:__.svg : Public Domain : Enzet
:Biclique K 3 3.svg : http://ru.wikipedia.org/w/index.php?title=:Biclique_K_3_3.svg : Creative Commons Attribution-Sharealike 3.0,2.5,2.0,1.0 :
Koko90
:K33 one crossing.svg : http://ru.wikipedia.org/w/index.php?title=:K33_one_crossing.svg : Public Domain : David Eppstein
:Hypergraph.gif : http://ru.wikipedia.org/w/index.php?title=:Hypergraph.gif : Creative Commons Attribution 2.5 : Claudio Rocchini
:Star product domination.svg : http://ru.wikipedia.org/w/index.php?title=:Star_product_domination.svg : Public Domain : David Eppstein
:Hadwiger conjecture.svg : http://ru.wikipedia.org/w/index.php?title=:Hadwiger_conjecture.svg : Public Domain : David Eppstein
:Question_mark2.svg : http://ru.wikipedia.org/w/index.php?title=:Question_mark2.svg : Public Domain : Original uploader was Acdx at
en.wikipedia
:Markstrm-Graph.svg : http://ru.wikipedia.org/w/index.php?title=:Markstrm-Graph.svg : Public Domain : David Eppstein
:Complete bipartite graph K3,1.svg : http://ru.wikipedia.org/w/index.php?title=:Complete_bipartite_graph_K3,1.svg : Public Domain :
User:Dbenbenn
:Icosahedron.svg : http://ru.wikipedia.org/w/index.php?title=:Icosahedron.svg : GNU Free Documentation License : User:DTR
:Sumner claw-free matching.svg : http://ru.wikipedia.org/w/index.php?title=:Sumner_claw-free_matching.svg : Public Domain : David Eppstein
:Claw-free augmenting path.svg : http://ru.wikipedia.org/w/index.php?title=:Claw-free_augmenting_path.svg : Public Domain : David Eppstein
:Hypercubestar.svg : http://ru.wikipedia.org/w/index.php?title=:Hypercubestar.svg : Public Domain : CommonsDelinker, Incnis Mrsi, Itai,
Mate2code, 4
:Hypercubeconstruction.png : http://ru.wikipedia.org/w/index.php?title=:Hypercubeconstruction.png : Public Domain : Original uploader was
Stdazi at en.wikipedia
:Groetzsch-graph.svg : http://ru.wikipedia.org/w/index.php?title=:Groetzsch-graph.svg : Public Domain : David Eppstein
:Gray graph hamiltonian.svg : http://ru.wikipedia.org/w/index.php?title=:Gray_graph_hamiltonian.svg : Creative Commons Attribution-Sharealike
3.0,2.5,2.0,1.0 : Koko90
File:Gray graph.svg : http://ru.wikipedia.org/w/index.php?title=:Gray_graph.svg : Public Domain : David Eppstein
File:gray_graph_2COL.svg : http://ru.wikipedia.org/w/index.php?title=:Gray_graph_2COL.svg : Creative Commons Attribution-Sharealike 3.0,2.5,2.0,1.0
: Koko90
File:gray_graph_3color_edge.svg : http://ru.wikipedia.org/w/index.php?title=:Gray_graph_3color_edge.svg : Creative Commons Attribution-Sharealike
3.0,2.5,2.0,1.0 : Koko90
File:Gray configuration.svg : http://ru.wikipedia.org/w/index.php?title=:Gray_configuration.svg : Public Domain : David Eppstein
:DesarguesGraph.svg : http://ru.wikipedia.org/w/index.php?title=:DesarguesGraph.svg : Public Domain : David Eppstein
:Desargues graph colored.svg : http://ru.wikipedia.org/w/index.php?title=:Desargues_graph_colored.svg : Creative Commons Attribution-Share Alike
: R. A. Nonenmacher
, 478
:Desargues graph 3color edge.svg : http://ru.wikipedia.org/w/index.php?title=:Desargues_graph_3color_edge.svg : Creative Commons Attribution-Sharealike

3.0 : Koko90
:Desargues graph 2COL.svg : http://ru.wikipedia.org/w/index.php?title=:Desargues_graph_2COL.svg : Creative Commons Attribution-Sharealike 3.0
: Koko90
:Circular-arc graph.svg : http://ru.wikipedia.org/w/index.php?title=:Circular-arc_graph.svg : Public Domain : David Eppstein
Image:Unit disk graph.svg : http://ru.wikipedia.org/w/index.php?title=:Unit_disk_graph.svg : Public Domain : David Eppstein at en.wikipedia
File:Petersen graph, unit distance.svg : http://ru.wikipedia.org/w/index.php?title=:Petersen_graph,_unit_distance.svg : Public Domain : User:Dbenbenn
File:Hypercubestar.svg : http://ru.wikipedia.org/w/index.php?title=:Hypercubestar.svg : Public Domain : CommonsDelinker, Incnis Mrsi, Itai,
Mate2code, 4
File:MbiusKantor unit distance.svg : http://ru.wikipedia.org/w/index.php?title=:MbiusKantor_unit_distance.svg : Public Domain : David Eppstein
File:Wheel7-woSpoke.svg : http://ru.wikipedia.org/w/index.php?title=:Wheel7-woSpoke.svg : Creative Commons Attribution-Sharealike 3.0,2.5,2.0,1.0 :
Jumpow
:Interest graph.gif : http://ru.wikipedia.org/w/index.php?title=:Interest_graph.gif : Creative Commons Attribution-Sharealike 3.0 : User:Tema
Timonin
:Interest_graph_vs_social_graph.png : http://ru.wikipedia.org/w/index.php?title=:Interest_graph_vs_social_graph.png : Creative Commons
Attribution-Sharealike 3.0 : User:Tema Timonin
:Clebsch Lombardi.svg : http://ru.wikipedia.org/w/index.php?title=:Clebsch_Lombardi.svg : Creative Commons Zero : David Eppstein
File:Clebsch graph hamiltonian.svg : http://ru.wikipedia.org/w/index.php?title=:Clebsch_graph_hamiltonian.svg : Creative Commons Attribution-Sharealike
3.0,2.5,2.0,1.0 : Koko90
File:Complete coloring clebsch graph.svg : http://ru.wikipedia.org/w/index.php?title=:Complete_coloring_clebsch_graph.svg : Creative Commons Attribution 2.5
: Claudio Rocchini
File:Clebsch graph 4COL.svg : http://ru.wikipedia.org/w/index.php?title=:Clebsch_graph_4COL.svg : Creative Commons Attribution-Sharealike 3.0,2.5,2.0,1.0
: Koko90
File:Clebsch_graph_5color_edge.svg : http://ru.wikipedia.org/w/index.php?title=:Clebsch_graph_5color_edge.svg : Creative Commons Attribution-Sharealike
3.0,2.5,2.0,1.0 : Koko90
File:Clebsch hypercube.svg : http://ru.wikipedia.org/w/index.php?title=:Clebsch_hypercube.svg : Public Domain : David Eppstein
:Levi graph of Pappus Configuration.png : http://ru.wikipedia.org/w/index.php?title=:Levi_graph_of_Pappus_Configuration.png : GNU Free Documentation
License : A3 nm, Magog the Ogre
:McGee graph hamiltonian.svg : http://ru.wikipedia.org/w/index.php?title=:McGee_graph_hamiltonian.svg : Creative Commons Attribution-Sharealike
3.0,2.5,2.0,1.0 : Koko90
Image:McGee graph crossing number.svg : http://ru.wikipedia.org/w/index.php?title=:McGee_graph_crossing_number.svg : Creative Commons
Attribution-Sharealike 3.0,2.5,2.0,1.0 : Koko90
Image:McGee graph 3COL.svg : http://ru.wikipedia.org/w/index.php?title=:McGee_graph_3COL.svg : Creative Commons Attribution-Sharealike 3.0,2.5,2.0,1.0
: Koko90
Image:McGee graph 3color edge.svg : http://ru.wikipedia.org/w/index.php?title=:McGee_graph_3color_edge.svg : Creative Commons Attribution-Sharealike
3.0,2.5,2.0,1.0 : Koko90
Image:Acyclic_coloring.svg : http://ru.wikipedia.org/w/index.php?title=:Acyclic_coloring.svg : Creative Commons Attribution 2.5 : Claudio Rocchini
Image:McGee graph.svg : http://ru.wikipedia.org/w/index.php?title=:McGee_graph.svg : Creative Commons Attribution-Sharealike 3.0 : Leshabirukov
:MbiusKantor unit distance.svg : http://ru.wikipedia.org/w/index.php?title=:MbiusKantor_unit_distance.svg : Public Domain : David
Eppstein
:MbiusKantor configuration.svg : http://ru.wikipedia.org/w/index.php?title=:MbiusKantor_configuration.svg : Public Domain : David
Eppstein
:MbiusKantor torus.svg : http://ru.wikipedia.org/w/index.php?title=:MbiusKantor_torus.svg : Public Domain : David Eppstein
:Polygon-circle graph.svg : http://ru.wikipedia.org/w/index.php?title=:Polygon-circle_graph.svg : Creative Commons Attribution 3.0 :
User:Rocchini
:Pappus graph LS.svg : http://ru.wikipedia.org/w/index.php?title=:Pappus_graph_LS.svg : Public Domain : David Eppstein
:Paley13.svg : http://ru.wikipedia.org/w/index.php?title=:Paley13.svg : Public Domain : Original uploader was David Eppstein at en.wikipedia
:Intersection graph.gif : http://ru.wikipedia.org/w/index.php?title=:Intersection_graph.gif : Creative Commons Attribution 2.5 : Claudio Rocchini
File:Petersen1 tiny.svg : http://ru.wikipedia.org/w/index.php?title=:Petersen1_tiny.svg : Creative Commons Attribution-Sharealike 3.0 : Leshabirukov
File:Petersen2 tiny.svg : http://ru.wikipedia.org/w/index.php?title=:Petersen2_tiny.svg : Creative Commons Attribution-Sharealike 3.0 : Leshabirukov
:Graf pred 1.jpg : http://ru.wikipedia.org/w/index.php?title=:Graf_pred_1.jpg : Public Domain : Màidez
:Graf pred 2.jpg : http://ru.wikipedia.org/w/index.php?title=:Graf_pred_2.jpg : Creative Commons Attribution-Sharealike 3.0 : Màidez
:Rado graph.svg : http://ru.wikipedia.org/w/index.php?title=:Rado_graph.svg : Public Domain : David Eppstein
:3D-Leveltorus-Reebgraph.png : http://ru.wikipedia.org/w/index.php?title=:3D-Leveltorus-Reebgraph.png : Public Domain : 3D-Leveltorus.png:
Kieff derivative work: Ilya Voyager (talk)
:Tutte eight cage.svg : http://ru.wikipedia.org/w/index.php?title=:Tutte_eight_cage.svg : Public Domain : User:Dbenbenn
File:Tutte-Coxeter graph crossing number.svg : http://ru.wikipedia.org/w/index.php?title=:Tutte-Coxeter_graph_crossing_number.svg : Creative Commons
File:Tutte-Coxeter graph 2COL.svg : http://ru.wikipedia.org/w/index.php?title=:Tutte-Coxeter_graph_2COL.svg : Creative Commons Attribution-Sharealike
3.0,2.5,2.0,1.0 : Koko90
File:Tutte-Coxeter graph 3color edge.svg : http://ru.wikipedia.org/w/index.php?title=:Tutte-Coxeter_graph_3color_edge.svg : Creative Commons
:Frucht planar Lombardi.svg : http://ru.wikipedia.org/w/index.php?title=:Frucht_planar_Lombardi.svg : Creative Commons Zero : David
Eppstein
File:Frucht_graph_3COL.svg : http://ru.wikipedia.org/w/index.php?title=:Frucht_graph_3COL.svg : Creative Commons Attribution-Sharealike 3.0 :
Koko90
File:Frucht Lombardi.svg : http://ru.wikipedia.org/w/index.php?title=:Frucht_Lombardi.svg : Public Domain : David Eppstein
:Halin graph.svg : http://ru.wikipedia.org/w/index.php?title=:Halin_graph.svg : Public Domain : David Eppstein
:Triangular prism as halin graph.svg : http://ru.wikipedia.org/w/index.php?title=:Triangular_prism_as_halin_graph.svg : Creative Commons
Attribution-Sharealike 3.0 : User:MathsPoetry
:Wheel graphs.svg : http://ru.wikipedia.org/w/index.php?title=:Wheel_graphs.svg : Public Domain : David Eppstein
:Heawood_Graph.svg : http://ru.wikipedia.org/w/index.php?title=:Heawood_Graph.svg : Creative Commons Attribution-Share Alike : R. A.
Nonenmacher
Image:Szilassi polyhedron.svg : http://ru.wikipedia.org/w/index.php?title=:Szilassi_polyhedron.svg : Public Domain : David Eppstein
:3-crossing Heawood graph.svg : http://ru.wikipedia.org/w/index.php?title=:3-crossing_Heawood_graph.svg : Public Domain : David Eppstein
:Heawood graph 3color edge.svg : http://ru.wikipedia.org/w/index.php?title=:Heawood_graph_3color_edge.svg : Creative Commons Attribution-Sharealike
3.0,2.5,2.0,1.0 : Koko90
, 479
:Heawood graph 2COL.svg : http://ru.wikipedia.org/w/index.php?title=:Heawood_graph_2COL.svg : Creative Commons Attribution-Sharealike 3.0,2.5,2.0,1.0

: Koko90
:7x-torus.svg : http://ru.wikipedia.org/w/index.php?title=:7x-torus.svg : Public Domain : Original uploader was David Eppstein at en.wikipedia
:Knight's graph.svg : http://ru.wikipedia.org/w/index.php?title=:Knight's_graph.svg : Public Domain : Smithers888
:King's graph.svg : http://ru.wikipedia.org/w/index.php?title=:King's_graph.svg : Public Domain : Smithers888
:Schlfli graph.svg : http://ru.wikipedia.org/w/index.php?title=:Schlfli_graph.svg : Creative Commons Attribution-Sharealike 3.0 : Claudio
Rocchini
:waiting.vertex.png : http://ru.wikipedia.org/w/index.php?title=:Waiting.vertex.png : Public Domain : Evatutin
:Undirected 6 cycle.svg : http://ru.wikipedia.org/w/index.php?title=:Undirected_6_cycle.svg : Public Domain : Original uploader was
Booyabazooka at en.wikipedia
Image:DC8.png : http://ru.wikipedia.org/w/index.php?title=:DC8.png : Public Domain : Dcoetzee, Grafite, Maksim, Man vyi
:Dualgraphs.png : http://ru.wikipedia.org/w/index.php?title=:Dualgraphs.png : Creative Commons Attribution-Sharealike 2.0 : Bender2k14,
Dcoetzee, Maksim, Perhelion, Petr Dlouh, 1
:Noniso dual graphs.svg : http://ru.wikipedia.org/w/index.php?title=:Noniso_dual_graphs.svg : Creative Commons Attribution-Sharealike 3.0 :
Kirelagin
:Simple-bipartite-graph.svg : http://ru.wikipedia.org/w/index.php?title=:Simple-bipartite-graph.svg : Public Domain : MistWiz
User:Dbenbenn
:RecursiveEvenBipartite.svg : http://ru.wikipedia.org/w/index.php?title=:RecursiveEvenBipartite.svg : Creative Commons Attribution-Sharealike
3.0,2.5,2.0,1.0 : Melchoir
:binary tree.svg : http://ru.wikipedia.org/w/index.php?title=:Binary_tree.svg : Public Domain : User:Dcoetzee
:BiggsSmith.svg : http://ru.wikipedia.org/w/index.php?title=:BiggsSmith.svg : Public Domain : Original uploader was Stolee at en.wikipedia
:Petersen graph complement.svg : http://ru.wikipedia.org/w/index.php?title=:Petersen_graph_complement.svg : Creative Commons Attribution-ShareAlike 3.0
Unported : Complement_graph_sample.gif: Claudio Rocchini derivative work: David Eppstein
:Tree decomposition.svg : http://ru.wikipedia.org/w/index.php?title=:Tree_decomposition.svg : Public Domain : David Eppstein
:3x3 grid graph haven.svg : http://ru.wikipedia.org/w/index.php?title=:3x3_grid_graph_haven.svg : Creative Commons Zero : User:David
Eppstein
:Partial 3-tree forbidden minors.svg : http://ru.wikipedia.org/w/index.php?title=:Partial_3-tree_forbidden_minors.svg : Public Domain : David
Eppstein
Image:Graph fractional coloring.svg : http://ru.wikipedia.org/w/index.php?title=:Graph_fractional_coloring.svg : Creative Commons Attribution-Sharealike
3.0,2.5,2.0,1.0 : Claudio Rocchini
File:Fractional coloring of C5.png : http://ru.wikipedia.org/w/index.php?title=:Fractional_coloring_of_C5.png : Creative Commons Attribution-Sharealike 3.0
: GTBacchus
:TSP Deutschland 3.png : http://ru.wikipedia.org/w/index.php?title=:TSP_Deutschland_3.png : Public Domain : Original uploader was Kapitn
Nemo at de.wikipedia. Later version(s) were uploaded by MrMonstar at de.wikipedia.
:Aquote1.png : http://ru.wikipedia.org/w/index.php?title=:Aquote1.png : Public Domain : INeverCry, Ignatus, Paul Pogonyshev, Rhanyeia, Waldir,
Wst, 1
:Aquote2.png : http://ru.wikipedia.org/w/index.php?title=:Aquote2.png : Public Domain : Berillium, INeverCry, Paul Pogonyshev, Rhanyeia,
Schekinov Alexey Victorovich, Waldir, Wst, 5
:WilliamRowanHamilton.jpeg : http://ru.wikipedia.org/w/index.php?title=:WilliamRowanHamilton.jpeg : Public Domain : Jastrow, Quibik,
Superborsuk
:Weighted_K4.svg : http://ru.wikipedia.org/w/index.php?title=:Weighted_K4.svg : Creative Commons Attribution-Sharealike 2.5 : Sdo
:TSP_degree_constraints.png : http://ru.wikipedia.org/w/index.php?title=:TSP_degree_constraints.png : Creative Commons Attribution-Sharealike 2.5
: User:Sdo
:TSP_short_cycles.png : http://ru.wikipedia.org/w/index.php?title=:TSP_short_cycles.png : Creative Commons Attribution-Sharealike 2.5 :
User:Sdo
:TSP_cutting_plane.png : http://ru.wikipedia.org/w/index.php?title=:TSP_cutting_plane.png : Creative Commons Attribution-Sharealike 2.5 : Sdo
Image:6n-graf.svg : http://ru.wikipedia.org/w/index.php?title=:6n-graf.svg : Public Domain : User:AzaToth
:6n-graf-clique.svg : http://ru.wikipedia.org/w/index.php?title=:6n-graf-clique.svg : Public Domain : Dcoetzee, Erin Silversmith, GeorgHH, 1

:Independent_set_graph.gif : http://ru.wikipedia.org/w/index.php?title=:Independent_set_graph.gif : Creative Commons Attribution-ShareAlike 3.0 Unported
: Claudio Rocchini
:Fermat Point Both Cases.png : http://ru.wikipedia.org/w/index.php?title=:Fermat_Point_Both_Cases.png : Public Domain : Alexeytuzhilin
:Hierarchical clustering simple diagram.svg : http://ru.wikipedia.org/w/index.php?title=:Hierarchical_clustering_simple_diagram.svg : Creative Commons
Attribution-ShareAlike 3.0 Unported : File:Hierarchical_clustering_diagram.png#file: Stathis Sideris on 10/02/2005 derivative work: Mhbrugman (talk)
:.png : http://ru.wikipedia.org/w/index.php?title=:.png : Creative Commons Attribution-Sharealike 3.0 : User:
:Diagrcz.png : http://ru.wikipedia.org/w/index.php?title=:Diagrcz.png : Creative Commons Attribution-Sharealike 3.0 : User:
Image:Graph isomorphism 1.gif : http://ru.wikipedia.org/w/index.php?title=:Graph_isomorphism_1.gif : Creative Commons Attribution-Sharealike 3.0,2.5,2.0,1.0
: :evatutin
: :evatutin
: :evatutin
:Interval graph.svg : http://ru.wikipedia.org/w/index.php?title=:Interval_graph.svg : Public Domain : David Eppstein
:Petersen1 tiny.svg : http://ru.wikipedia.org/w/index.php?title=:Petersen1_tiny.svg : Creative Commons Attribution-Sharealike 3.0 : Leshabirukov
:Heawood tiny.svg : http://ru.wikipedia.org/w/index.php?title=:Heawood_tiny.svg : Creative Commons Attribution-Sharealike 3.0 : Leshabirukov
:McGee graph.svg : http://ru.wikipedia.org/w/index.php?title=:McGee_graph.svg : Creative Commons Attribution-Sharealike 3.0 : Leshabirukov
:Hoffman_singleton_graph_circle2.gif : http://ru.wikipedia.org/w/index.php?title=:Hoffman_singleton_graph_circle2.gif : Creative Commons Attribution 2.5
: Claudio Rocchini
:VR complex.svg : http://ru.wikipedia.org/w/index.php?title=:VR_complex.svg : Public Domain : David Eppstein
:CyclesW4.svg : http://ru.wikipedia.org/w/index.php?title=:CyclesW4.svg : Creative Commons Attribution-Sharealike 3.0 : Koko90
:Unconnected-graph.svg : http://ru.wikipedia.org/w/index.php?title=:Unconnected-graph.svg : Public Domain : Dmitry Dzhus
Image:NetworkTopology-Ring.png : http://ru.wikipedia.org/w/index.php?title=:NetworkTopology-Ring.png : Public Domain : Foobaz,
LoStrangolatore, MisterSanderson
:Mutually-inscribed-pentagons.svg : http://ru.wikipedia.org/w/index.php?title=:Mutually-inscribed-pentagons.svg : Public Domain : Original
uploader was David Eppstein at en.wikipedia
, 480
:Desargues theorem alt.svg : http://ru.wikipedia.org/w/index.php?title=:Desargues_theorem_alt.svg : Creative Commons Attribution-Sharealike 3.0

: Jujutacular
:Petersen2 tiny.svg : http://ru.wikipedia.org/w/index.php?title=:Petersen2_tiny.svg : Creative Commons Attribution-Sharealike 3.0 : Leshabirukov
:Non-Desargues configuration.svg : http://ru.wikipedia.org/w/index.php?title=:Non-Desargues_configuration.svg : Public Domain : David
Eppstein
Image: Crown graphs.svg : http://ru.wikipedia.org/w/index.php?title=:Crown_graphs.svg : Public Domain : David Eppstein
File:Bipartite-dimension-biclique-cover.svg : http://ru.wikipedia.org/w/index.php?title=:Bipartite-dimension-biclique-cover.svg : Creative Commons Attribution 3.0
: Original uploader was Hermel at en.wikipedia
:Rook's graph.svg : http://ru.wikipedia.org/w/index.php?title=:Rook's_graph.svg : Public Domain : Smithers888
:Paley9-perfect.svg : http://ru.wikipedia.org/w/index.php?title=:Paley9-perfect.svg : Public Domain : Original uploader was David Eppstein at
en.wikipedia
:chess_zhor_26.svg : http://ru.wikipedia.org/w/index.php?title=:Chess_zhor_26.svg : Public Domain : User:Klin
:chess___l45.svg : http://ru.wikipedia.org/w/index.php?title=:Chess_l45.svg : GNU Free Documentation License : en:User:Cburnett
:chess___d45.svg : http://ru.wikipedia.org/w/index.php?title=:Chess_d45.svg : GNU Free Documentation License : en:User:Cburnett
:chess_rld45.svg : http://ru.wikipedia.org/w/index.php?title=:Chess_rld45.svg : GNU Free Documentation License : en:User:Cburnett
:chess_rll45.svg : http://ru.wikipedia.org/w/index.php?title=:Chess_rll45.svg : GNU Free Documentation License : en:User:Cburnett
:Henneberg construction of Moser spindle.svg : http://ru.wikipedia.org/w/index.php?title=:Henneberg_construction_of_Moser_spindle.svg : Creative
Commons Zero : User:David Eppstein
File:6n-graf.svg : http://ru.wikipedia.org/w/index.php?title=:6n-graf.svg : Public Domain : User:AzaToth
:Directed graph.svg : http://ru.wikipedia.org/w/index.php?title=:Directed_graph.svg : Public Domain : Dcoetzee, Grafite, Luks
Image:Graph123.png : http://ru.wikipedia.org/w/index.php?title=:Graph123.png : Public Domain : Magikwood
image:6n-graf.svg : http://ru.wikipedia.org/w/index.php?title=:6n-graf.svg : Public Domain : User:AzaToth
Image:6n-graph2.svg : http://ru.wikipedia.org/w/index.php?title=:6n-graph2.svg : Public Domain : Booyabazooka, Dcoetzee, 1
:Median graph.svg : http://ru.wikipedia.org/w/index.php?title=:Median_graph.svg : Public Domain : David Eppstein
:Tree median.svg : http://ru.wikipedia.org/w/index.php?title=:Tree_median.svg : Public Domain : David Eppstein
:Squaregraph.svg : http://ru.wikipedia.org/w/index.php?title=:Squaregraph.svg : Public Domain : David Eppstein
:Distributive lattice example.svg : http://ru.wikipedia.org/w/index.php?title=:Distributive_lattice_example.svg : Public Domain : David Eppstein
:Cube retraction.svg : http://ru.wikipedia.org/w/index.php?title=:Cube_retraction.svg : Public Domain : David Eppstein
:Median from triangle-free.svg : http://ru.wikipedia.org/w/index.php?title=:Median_from_triangle-free.svg : Public Domain : David Eppstein
:Buneman graph(rus).svg : http://ru.wikipedia.org/w/index.php?title=:Buneman_graph(rus).svg : GNU Free Documentation License : Jumpow
:Graph-Cartesian-product.svg : http://ru.wikipedia.org/w/index.php?title=:Graph-Cartesian-product.svg : Public Domain : Original uploader was
David Eppstein at en.wikipedia
:Small-world-network-example.png : http://ru.wikipedia.org/w/index.php?title=:Small-world-network-example.png : Creative Commons
Attribution-Sharealike 3.0 : User:Schulllz
File:Random graph gephi.png : http://ru.wikipedia.org/w/index.php?title=:Random_graph_gephi.png : Creative Commons Attribution 3.0 :
User:Schulllz
:Barabasi Albert model.gif : http://ru.wikipedia.org/w/index.php?title=:Barabasi_Albert_model.gif : Creative Commons Attribution-Sharealike 3.0
: Horvth rpd
:Barabasi Albert generated network.jpg : http://ru.wikipedia.org/w/index.php?title=:Barabasi_Albert_generated_network.jpg : Creative Commons
Attribution-Sharealike 3.0 : User:Yves berset
:Barabasi-albert model degree distribution.svg : http://ru.wikipedia.org/w/index.php?title=:Barabasi-albert_model_degree_distribution.svg : Creative
Commons Attribution-Sharealike 3.0 : Arpad Horvath
:Graph cut edges.svg : http://ru.wikipedia.org/w/index.php?title=:Graph_cut_edges.svg : GNU Free Documentation License : User:Booyabazooka
:Multi-pseudograph.svg : http://ru.wikipedia.org/w/index.php?title=:Multi-pseudograph.svg : Creative Commons Attribution-Sharealike 3.0 :
0x24a537r9
File:Shannon multigraph 2.svg : http://ru.wikipedia.org/w/index.php?title=:Shannon_multigraph_2.svg : Creative Commons Attribution 3.0 : Kmhkmh
File:Multigraph-edge-coloring.svg : http://ru.wikipedia.org/w/index.php?title=:Multigraph-edge-coloring.svg : Creative Commons Zero : David
Eppstein
:Grtzsch graph as a Mycielskian.svg : http://ru.wikipedia.org/w/index.php?title=:Grtzsch_graph_as_a_Mycielskian.svg : Public Domain :
David Eppstein
:Mycielski graphs.svg : http://ru.wikipedia.org/w/index.php?title=:Mycielski_graphs.svg : Public Domain : Dcoetzee, Mlepicki
:Mycielski graph k4 hamiltonian path.svg : http://ru.wikipedia.org/w/index.php?title=:Mycielski_graph_k4_hamiltonian_path.svg : Public Domain
: Dcoetzee, Mlepicki
:Cube-maximal-independence.svg : http://ru.wikipedia.org/w/index.php?title=:Cube-maximal-independence.svg : Public Domain : David
Eppstein
:Directed acyclic graph.png : http://ru.wikipedia.org/w/index.php?title=:Directed_acyclic_graph.png : Public Domain : Anarkman, Dcoetzee,
Ddxc, EugeneZelenko, F, Joey-das-WBF
File:Kneser graph KG(5,2).svg : http://ru.wikipedia.org/w/index.php?title=:Kneser_graph_KG(5,2).svg : Public Domain : Mate2code
File:Odd graph O4.svg : http://ru.wikipedia.org/w/index.php?title=:Odd_graph_O4.svg : Public Domain : David Eppstein
:Drer graph.svg : http://ru.wikipedia.org/w/index.php?title=:Drer_graph.svg : Creative Commons Attribution-Sharealike 3.0 : Koko90
:Generalized Petersen 9 2 Hamiltonicity.svg : http://ru.wikipedia.org/w/index.php?title=:Generalized_Petersen_9_2_Hamiltonicity.svg : Public Domain
: David Eppstein
Image:Petersen1 tiny.svg : http://ru.wikipedia.org/w/index.php?title=:Petersen1_tiny.svg : Creative Commons Attribution-Sharealike 3.0 : Leshabirukov
Image:Heawood_Graph.svg : http://ru.wikipedia.org/w/index.php?title=:Heawood_Graph.svg : Creative Commons Attribution-Share Alike : R. A.
Nonenmacher
Image:Tutte eight cage.svg : http://ru.wikipedia.org/w/index.php?title=:Tutte_eight_cage.svg : Public Domain : User:Dbenbenn
:Octahedron graph.png : http://ru.wikipedia.org/w/index.php?title=:Octahedron_graph.png : GNU Free Documentation License : User:Arbor
:3node digraph0.svg : http://ru.wikipedia.org/w/index.php?title=:3node_digraph0.svg : Creative Commons Attribution-Sharealike 3.0 :
Leshabirukov
Leshabirukov
, 481

Leshabirukov
Leshabirukov
Leshabirukov
Leshabirukov
Leshabirukov
Leshabirukov
Leshabirukov
Leshabirukov
Leshabirukov
Leshabirukov
Leshabirukov
Leshabirukov
Leshabirukov
Leshabirukov
:Divisors 12.svg : http://ru.wikipedia.org/w/index.php?title=:Divisors_12.svg : Creative Commons Attribution-ShareAlike 3.0 Unported : Klaus
Rder
:Maximal-matching.svg : http://ru.wikipedia.org/w/index.php?title=:Maximal-matching.svg : Creative Commons Attribution-Sharealike 3.0 :
Miym
:Maximum-matching-labels.svg : http://ru.wikipedia.org/w/index.php?title=:Maximum-matching-labels.svg : Creative Commons Attribution-Sharealike 3.0
: Miym
:Complete graph K5.svg : http://ru.wikipedia.org/w/index.php?title=:Complete_graph_K5.svg : Public Domain : David Benbennick wrote this file.
User:Dbenbenn
:Kuratowski.gif : http://ru.wikipedia.org/w/index.php?title=:Kuratowski.gif : Creative Commons Attribution 3.0 : Pablo Angulo using Sage
software
:Complete graph K7.svg : http://ru.wikipedia.org/w/index.php?title=:Complete_graph_K7.svg : Public Domain : User:Dbenbenn
:3-simplex graph.svg : http://ru.wikipedia.org/w/index.php?title=:3-simplex_graph.svg : Creative Commons Attribution-Sharealike 3.0,2.5,2.0,1.0 :
Koko90
Koko90
Koko90
Koko90
Koko90
Koko90
Koko90
:10-simplex graph.svg : http://ru.wikipedia.org/w/index.php?title=:10-simplex_graph.svg : Creative Commons Attribution-Sharealike 3.0,2.5,2.0,1.0
: Koko90
:11-simplex graph.svg : http://ru.wikipedia.org/w/index.php?title=:11-simplex_graph.svg : Creative Commons Attribution-Sharealike 3.0,2.5,2.0,1.0
: Koko90
Image:Biclique_K_3_5.svg : http://ru.wikipedia.org/w/index.php?title=:Biclique_K_3_5.svg : Creative Commons Attribution-Sharealike 3.0,2.5,2.0,1.0 :
Koko90
Image:Star graphs.svg : http://ru.wikipedia.org/w/index.php?title=:Star_graphs.svg : Creative Commons Attribution-Sharealike 3.0,2.5,2.0,1.0 : Koko90
Image:Biclique_K_3_3.svg : http://ru.wikipedia.org/w/index.php?title=:Biclique_K_3_3.svg : Creative Commons Attribution-Sharealike 3.0,2.5,2.0,1.0 :
Koko90
:Snakeinthebox.svg : http://ru.wikipedia.org/w/index.php?title=:Snakeinthebox.svg : Public Domain : Matthewbeckler
:Depth-first tree.svg : http://ru.wikipedia.org/w/index.php?title=:Depth-first_tree.svg : GNU Free Documentation License : Braindrain0000,
Dmitry Dzhus, Inductiveload, Steinninn, WikipediaMaster, 1
:Konigsberg bridges.png : http://ru.wikipedia.org/w/index.php?title=:Konigsberg_bridges.png : GNU Free Documentation License : Bogdan
Giuc
:7 bridges.svg : http://ru.wikipedia.org/w/index.php?title=:7_bridges.svg : GNU Free Documentation License : Booyabazooka, Rocket000,
Ronaldino, Squizzz, 2
:konigsburg graph.svg : http://ru.wikipedia.org/w/index.php?title=:Konigsburg_graph.svg : GNU Free Documentation License : AnonMoos,
McZusatz, Piotrus, Riojajar, Squizzz
:Konigsburg.png : http://ru.wikipedia.org/w/index.php?title=:Konigsburg.png : Public Domain : KR, Kneiphof, Vaya
:Konigsburg graph.svg : http://ru.wikipedia.org/w/index.php?title=:Konigsburg_graph.svg : GNU Free Documentation License : AnonMoos,
McZusatz, Piotrus, Riojajar, Squizzz
, 482
:.jpg : http://ru.wikipedia.org/w/index.php?title=:.jpg : Public Domain :

:15-puzzle.svg : http://ru.wikipedia.org/w/index.php?title=:15-puzzle.svg : Public Domain : en:User:Booyabazooka
:15-puzzle-loyd.svg : http://ru.wikipedia.org/w/index.php?title=:15-puzzle-loyd.svg : Public Domain : en:User:Booyabazooka
:logic.control.algorithm.separation.png : http://ru.wikipedia.org/w/index.php?title=:Logic.control.algorithm.separation.png : Public Domain :
Evatutin
:SqCogWheel-5.svg : http://ru.wikipedia.org/w/index.php?title=:SqCogWheel-5.svg : Creative Commons Zero : Jumpow
:Petersen graph 3-coloring.svg : http://ru.wikipedia.org/w/index.php?title=:Petersen_graph_3-coloring.svg : Public Domain : Booyabazooka,
Dcoetzee, Mate2code
:Graph with all three-colourings 2.svg : http://ru.wikipedia.org/w/index.php?title=:Graph_with_all_three-colourings_2.svg : GNU Free Documentation
License : (PNG file), (corrections + SVG conversion)
:Chromatic polynomial of all 3-vertex graphs.png : http://ru.wikipedia.org/w/index.php?title=:Chromatic_polynomial_of_all_3-vertex_graphs.png : Creative
Commons Attribution-Sharealike 3.0 :
:Split graph.svg : http://ru.wikipedia.org/w/index.php?title=:Split_graph.svg : Public Domain : Original uploader was David Eppstein at
en.wikipedia
:Complete-edge-coloring.svg : http://ru.wikipedia.org/w/index.php?title=:Complete-edge-coloring.svg : Creative Commons Zero : David Eppstein
:Class-2-planar-3-regular.svg : http://ru.wikipedia.org/w/index.php?title=:Class-2-planar-3-regular.svg : Creative Commons Zero : David
Eppstein
:Multigraph-edge-coloring.svg : http://ru.wikipedia.org/w/index.php?title=:Multigraph-edge-coloring.svg : Creative Commons Zero : David
Eppstein
:K33 parallel edge coloring.svg : http://ru.wikipedia.org/w/index.php?title=:K33_parallel_edge_coloring.svg : Creative Commons Zero : David
Eppstein
:K44 arboricity.svg : http://ru.wikipedia.org/w/index.php?title=:K44_arboricity.svg : Public Domain : David Eppstein
Image:Gray graph 2COL.svg : http://ru.wikipedia.org/w/index.php?title=:Gray_graph_2COL.svg : Creative Commons Attribution-Sharealike 3.0,2.5,2.0,1.0
: Koko90
File:Line graph construction 1.svg : http://ru.wikipedia.org/w/index.php?title=:Line_graph_construction_1.svg : GNU Free Documentation License :
User:Booyabazooka
User:Booyabazooka
User:Booyabazooka
User:Booyabazooka
:Forbidden line subgraphs.svg : http://ru.wikipedia.org/w/index.php?title=:Forbidden_line_subgraphs.svg : Public Domain : Originally uploaded
as a png image by David Eppstein at en.wikipedia. Redrawn as svg by Braindrain0000 at en.wikipedia
:LineGraphExampleA.svg : http://ru.wikipedia.org/w/index.php?title=:LineGraphExampleA.svg : Public Domain : Ilmari Karonen ()
:Images.png : http://ru.wikipedia.org/w/index.php?title=:Images.png : Creative Commons Attribution 2.5 : Adrignola, Avatar
:Image-silk.png : http://ru.wikipedia.org/w/index.php?title=:Image-silk.png : Creative Commons Attribution 2.5 : Adrignola, Avatar
:Self-complementary NZ graph.svg : http://ru.wikipedia.org/w/index.php?title=:Self-complementary_NZ_graph.svg : Public Domain : David
Eppstein
:Self-complementary 5 graph.svg : http://ru.wikipedia.org/w/index.php?title=:Self-complementary_5_graph.svg : Creative Commons
Attribution-Sharealike 3.0,2.5,2.0,1.0 : Jumpow
:Flower snarks.svg : http://ru.wikipedia.org/w/index.php?title=:Flower_snarks.svg : Creative Commons Attribution-Sharealike 3.0,2.5,2.0,1.0 :
Koko90
:Flower snarkv.svg : http://ru.wikipedia.org/w/index.php?title=:Flower_snarkv.svg : Public Domain : Grafite, Hakeem.gadi, Koko90
:Flower snark 3COL.svg : http://ru.wikipedia.org/w/index.php?title=:Flower_snark_3COL.svg : Creative Commons Attribution-Sharealike 3.0,2.5,2.0,1.0
: Koko90
:Flower_snark_4color edge.svg : http://ru.wikipedia.org/w/index.php?title=:Flower_snark_4color_edge.svg : Creative Commons Attribution-Sharealike
3.0,2.5,2.0,1.0 : Koko90
:Flower_snark_original.svg : http://ru.wikipedia.org/w/index.php?title=:Flower_snark_original.svg : Creative Commons Attribution-Sharealike 3.0,2.5,2.0,1.0
: Koko90
:First Blanusa snark.svg : http://ru.wikipedia.org/w/index.php?title=:First_Blanusa_snark.svg : Creative Commons Attribution-Sharealike 3.0,2.5,2.0,1.0
: Koko90
:First Blanusa snark 3COL.svg : http://ru.wikipedia.org/w/index.php?title=:First_Blanusa_snark_3COL.svg : Creative Commons Attribution-Sharealike
3.0,2.5,2.0,1.0 : Koko90
:First Blanusa snark 4edge color.svg : http://ru.wikipedia.org/w/index.php?title=:First_Blanusa_snark_4edge_color.svg : Creative Commons
:Second Blanusa snark 3COL.svg : http://ru.wikipedia.org/w/index.php?title=:Second_Blanusa_snark_3COL.svg : Creative Commons Attribution-Sharealike
3.0,2.5,2.0,1.0 : Koko90
:Second Blanusa snark 4edge color.svg : http://ru.wikipedia.org/w/index.php?title=:Second_Blanusa_snark_4edge_color.svg : Creative Commons
:Watkins snark.svg : http://ru.wikipedia.org/w/index.php?title=:Watkins_snark.svg : Creative Commons Attribution-Sharealike 3.0,2.5,2.0,1.0 :
Koko90
:Watkins snark 3COL.svg : http://ru.wikipedia.org/w/index.php?title=:Watkins_snark_3COL.svg : Creative Commons Attribution-Sharealike 3.0,2.5,2.0,1.0
: Koko90
:Watkins snark 4edge color.svg : http://ru.wikipedia.org/w/index.php?title=:Watkins_snark_4edge_color.svg : Creative Commons Attribution-Sharealike
3.0,2.5,2.0,1.0 : Koko90
Image:Paley9-perfect.svg : http://ru.wikipedia.org/w/index.php?title=:Paley9-perfect.svg : Public Domain : Original uploader was David Eppstein at
en.wikipedia
File:7-hole and antihole.svg : http://ru.wikipedia.org/w/index.php?title=:7-hole_and_antihole.svg : Creative Commons Zero : User:David Eppstein
:Social graph.gif : http://ru.wikipedia.org/w/index.php?title=:Social_graph.gif : Creative Commons Attribution-Sharealike 3.0 : Festys
:Social Graph Models.png : http://ru.wikipedia.org/w/index.php?title=:Social_Graph_Models.png : Creative Commons Attribution-Sharealike 3.0
: Albedo-ukr, Festys
Image:harborth graph.jpg : http://ru.wikipedia.org/w/index.php?title=:Harborth_graph.jpg : Creative Commons Attribution-Sharealike 3.0 : Terrek
(talk). Original uploader was Terrek at en.wikipedia
File:Matchstick-3-regualar.svg : http://ru.wikipedia.org/w/index.php?title=:Matchstick-3-regualar.svg : Creative Commons Attribution-Sharealike 3.0,2.5,2.0,1.0
: Jumpow
File:Prism_graph_8-crossed_.svg : http://ru.wikipedia.org/w/index.php?title=:Prism_graph_8-crossed_.svg : Creative Commons Attribution-Sharealike
3.0,2.5,2.0,1.0 : Jumpow
, 483
:UndirectedDegrees (Loop).svg : http://ru.wikipedia.org/w/index.php?title=:UndirectedDegrees_(Loop).svg : Creative Commons Attribution-Share Alike

: Melchoir (source); pan BMP
:Conjugate-dessins.svg : http://ru.wikipedia.org/w/index.php?title=:Conjugate-dessins.svg : Public Domain : David Eppstein
:Depth-first-tree.png : http://ru.wikipedia.org/w/index.php?title=:Depth-first-tree.png : GNU Free Documentation License : Alexander Drichel,
Braindrain0000, Bukk, Dcoetzee, EugeneZelenko, Regnaron, 2
:Dilworth-via-Knig.svg : http://ru.wikipedia.org/w/index.php?title=:Dilworth-via-Knig.svg : Public Domain : Original uploader was David
Eppstein at en.wikipedia
File:Koenigs-theorem-graph.svg : http://ru.wikipedia.org/w/index.php?title=:Koenigs-theorem-graph.svg : Public Domain : David Eppstein
File:Koenigs-theorem-proof.svg : http://ru.wikipedia.org/w/index.php?title=:Koenigs-theorem-proof.svg : Public Domain : David Eppstein
Image:Cayley's formula 2-4.svg : http://ru.wikipedia.org/w/index.php?title=:Cayley's_formula_2-4.svg : : User:Rocchini
:Identity graph1.svg : http://ru.wikipedia.org/w/index.php?title=:Identity_graph1.svg : Public Domain : Hikin1987
Image:Total coloring foster cage.svg : http://ru.wikipedia.org/w/index.php?title=:Total_coloring_foster_cage.svg : Creative Commons Attribution 2.5 :
Claudio Rocchini
:tred-G.svg : http://ru.wikipedia.org/w/index.php?title=:Tred-G.svg : Public Domain : Dmitry Dzhus, Grafite, Jochen Burghardt, Ksd5
:tred-Gprime.svg : http://ru.wikipedia.org/w/index.php?title=:Tred-Gprime.svg : Creative Commons Zero : User:A3 nm
File:Trapezoid-Graph.svg : http://ru.wikipedia.org/w/index.php?title=:Trapezoid-Graph.svg : Creative Commons Attribution-Sharealike 3.0,2.5,2.0,1.0 :
Jumpow
File:Trapezoid-Sets.svg : http://ru.wikipedia.org/w/index.php?title=:Trapezoid-Sets.svg : Creative Commons Attribution-Sharealike 3.0,2.5,2.0,1.0 :
Jumpow
File:Trapezoid-Boxes.svg : http://ru.wikipedia.org/w/index.php?title=:Trapezoid-Boxes.svg : Creative Commons Attribution-Sharealike 3.0,2.5,2.0,1.0 :
Jumpow
File:Trapezoid-Circle.svg : http://ru.wikipedia.org/w/index.php?title=:Trapezoid-Circle.svg : Creative Commons Attribution-Sharealike 3.0,2.5,2.0,1.0 :
Jumpow
Image:Complete_graph_K3.svg : http://ru.wikipedia.org/w/index.php?title=:Complete_graph_K3.svg : Public Domain : David Benbennick wrote this
file.
Image:4-tournament.svg : http://ru.wikipedia.org/w/index.php?title=:4-tournament.svg : Public Domain : Booyabazooka
:8-tournament-transitive.svg : http://ru.wikipedia.org/w/index.php?title=:8-tournament-transitive.svg : Public Domain : Booyabazooka
:Chordal-graph.svg : http://ru.wikipedia.org/w/index.php?title=:Chordal-graph.svg : Public Domain : Dcoetzee, Grafite, Tizio
:Desargues_graph_3color_edge.svg : http://ru.wikipedia.org/w/index.php?title=:Desargues_graph_3color_edge.svg : Creative Commons Attribution-Sharealike
3.0 : Koko90
File:Paley13.svg : http://ru.wikipedia.org/w/index.php?title=:Paley13.svg : Public Domain : Original uploader was David Eppstein at en.wikipedia
File:Crown graphs.svg : http://ru.wikipedia.org/w/index.php?title=:Crown_graphs.svg : Public Domain : David Eppstein
:Sample_graph.svg : http://ru.wikipedia.org/w/index.php?title=:Sample_graph.svg : Creative Commons Attribution-Share Alike : Acrobat
:Hamiltonian_Dodecahedron_Graph.svg : http://ru.wikipedia.org/w/index.php?title=:Hamiltonian_Dodecahedron_Graph.svg : Creative Commons
Attribution-Sharealike 3.0 : Zorgit
:Hamilton path.gif : http://ru.wikipedia.org/w/index.php?title=:Hamilton_path.gif : Creative Commons Attribution 2.5 : Claudio Rocchini
:6n-graph2.svg : http://ru.wikipedia.org/w/index.php?title=:6n-graph2.svg : Public Domain : Booyabazooka, Dcoetzee, 1
:Path-graph.svg : http://ru.wikipedia.org/w/index.php?title=:Path-graph.svg : Public Domain : Momotaro
:Directed cycle.svg : http://ru.wikipedia.org/w/index.php?title=:Directed_cycle.svg : Public domain : en:User:Dcoetzee, User:Stannered
:Labelled Eulergraph.svg : http://ru.wikipedia.org/w/index.php?title=:Labelled_Eulergraph.svg : Public Domain : S Sepp
484

Creative Commons Attribution-Share Alike 3.0
//creativecommons.org/licenses/by-sa/3.0/

Graphs Theory

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Graphs Theory

Uploaded by

Copyright:

Available Formats

Graphs Theory

PDF mwlib. . http://code.pediapress.com/

Linux, Mac OS X . UNIX-, Windows

Eclipse Public License

EPL (Eclipse Public License)

Haus vom Nikolaus

2 Das ist das Haus vom Ni-ko-laus und ne-ben-an vom

[3] http:/ / www. centrifugesystems. com/

A(G) 4 (G) = 3. (Grnbaum

San SkulrattanakulchaiAcyclic colorings of subcubic graphs // Information Processing Letters. 2004.

theorem (graph theory) ( , )

Qn (n > 1) en:Lvy family of graphs

en:graph bandwidth Qn .[2]

en:Marion Cameron Gray

(Marui, Pisanski 2000) .

240 (S5 Z/2Z)

, en:integral graph en:Spectral graph

. (Coxeter 1950) (Threlfall 1932). 96-

J. P. Spinrad. Efficient Graph Representations. American Mathematical Society, 2003.

Weisstein, Eric W. Dual graph (http://mathworld.wolfram.com/DualGraph.html)(.) Wolfram

T( y(1), ..., y(n) ) = root: y(k)

T( y(1), ..., y(k+1) ) = F ( T( y(1), ..., y(k) ), y(k+1) )

en:Coxeter graph 28 4 7 {3,2,2,1;1,1,1,2}

en:Biggs-Smith graph 102 7 9 {3,2,2,2,1,1,1;1,1,1,1,1,1,3}

M. W. Bern, E. L. Lawler, A. L. WongLinear-time computation of optimal subgraphs of decomposable graphs //

en:dual problem "

1970- 1980- , (.Martin

[2] GPL C, Python, R,

NetworkX BSD Python [3]

OpenOpt BSD Python , , /

get_independent_set(r) . , , O(|V| + |E|).

Weisstein, Eric W. Maximal Independent Vertex Set (http://mathworld.wolfram.com/

r = 4: 5 8 19 26 67 80 275 384 728

r = 5: 6 10 30 42 152 170 2730

r = 6: 7 12 40 62 294 312 7812

NetworkX BSD Python , max_clique

maxClique CRAPL Java , DIMACS

OpenOpt BSD Python , ,

(Degree distribution of nodes)

Barnes John Gems of Geometry. Springer, 2012. .9597. ISBN 9783642309649

en:Kneser graph Hn,1,

(Miklavi, Poronik, 2003) ,

Klavar, Mulder 1999, Bandelt, Chepoi 2008 Knuth 2008.

(Duffus, Rival 1983)

X. S. Yang (2001). Chaos in small-world networks (http://arxiv.org/pdf/1003.4940.pdf). Phys. Rev. E 63,

Dynamic Proximity Networks (http://demonstrations.wolfram.com/DynamicProximityNetworks/) by Seth J.

Sh(2) Sh(3) Sh(4) Sh(5) Sh(6) Sh(7)

, G n m , (G) 2n+1 3m+n .

On en:Norman Biggs (mathematician)

{u0, u1, ..., un1, v0, v1, ..., vn1}

K1: 0 K2: 1 K3: 3 K4: 6

K5: 10 K6: 15 K7: 21 K8: 28

K9: 36 K10: 45 K11: 55 K12: 66

(subsumption, variable propagation):

Wilf, H. S. (1986), Algorithms and Complexity, PrenticeHall

E. Burke, D. De Werra, J. Kingston{{{}}} / J. L. Gross, J. Yellen. CRC Press, 2004. .462.

Allen J. SchwenkEnumeration of Hamiltonian cycles in certain generalized Petersen graphs // Journal of

(u,v). k u-v- (u,v).

G L(G), L(G) L(G)

M pN, N , G(n,M) G(n,p),

The Electronic Journal of Combinatorics

2008 (M. Ghebleh) ,

1958- en:Tibor Gallai,

en:trivially perfect graph ( ),