-
1
-
-
0015054236
-
On vector spaces associated with a graph
-
1 W.‐K. Chen, On vector spaces associated with a graph, SIAM J Appl Math 20 (1971), 525–529.
-
(1971)
SIAM J Appl Math
, vol.20
, pp. 525-529
-
-
Chen, W.‐K.1
-
2
-
-
1842780616
-
Interchangeability of relevant cycles in graphs
-
2 P. M. Gleiss, J. Leydold, and P. F. Stadler, Interchangeability of relevant cycles in graphs, Elec J Comb 7 (2000), R16 [16 pages].
-
(2000)
Elec J Comb
, vol.7
, pp. R16
-
-
Gleiss, P.M.1
Leydold, J.2
Stadler, P.F.3
-
3
-
-
0038438519
-
Studies in minimally connected graphs, in: Combinatorial mathematics and its applications
-
3 R. Halin, Studies in minimally connected graphs, In: D. J. A. Welsh, (Editor) Combinatorial mathematics and its applications, New York, Academic Press, 1971, pp. 129–136.
-
(1971)
, pp. 129-136
-
-
Halin, R.1
-
4
-
-
38249005115
-
When do short cycles generate the cycle space?
-
4 D. Hartvigsen and R. Mardon, When do short cycles generate the cycle space? J Comb Theory Ser B 57 (1993), 88–99.
-
(1993)
J Comb Theory Ser B
, vol.57
, pp. 88-99
-
-
Hartvigsen, D.1
Mardon, R.2
-
5
-
-
1842629269
-
The all‐pair min‐cut problem and the minimum cycle basis problem on planar graphs
-
5 D. Hartvigsen and R. Mardon, The all‐pair min‐cut problem and the minimum cycle basis problem on planar graphs, SIAM J Discr Math 7 (1994), 403–418.
-
(1994)
SIAM J Discr Math
, vol.7
, pp. 403-418
-
-
Hartvigsen, D.1
Mardon, R.2
-
6
-
-
0023328260
-
A polynomial‐time algorithm to find the shortest cycle basis of a graph
-
6 J. D. Horton, A polynomial‐time algorithm to find the shortest cycle basis of a graph, SIAM J Comput 16 (1987), 359–366.
-
(1987)
SIAM J Comput
, vol.16
, pp. 359-366
-
-
Horton, J.D.1
-
7
-
-
10044255454
-
Minimal cycle basis of outerplanar graphs
-
7 J. Leydold and P. F. Stadler, Minimal cycle basis of outerplanar graphs, Elec J Comb 5 (1998), 209–222. Paper No. #R16 (14 pages).
-
(1998)
Elec J Comb
, vol.5
, pp. 209-222
-
-
Leydold, J.1
Stadler, P.F.2
-
8
-
-
0039903078
-
A structural characterization of planar combinatorial graphs
-
8 S. MacLane, A structural characterization of planar combinatorial graphs, Duke Math J 3 (1937), 460–472.
-
(1937)
Duke Math J
, vol.3
, pp. 460-472
-
-
MacLane, S.1
-
9
-
-
0042794756
-
Induced cycle structure and outerplanarity
-
9 T. A. McKee, Induced cycle structure and outerplanarity, Discr Math 223 (2000), 387–392.
-
(2000)
Discr Math
, vol.223
, pp. 387-392
-
-
McKee, T.A.1
-
10
-
-
0012035459
-
Mathematical basis of ring‐finding algorithms in CIDS
-
10 M. Plotkin, Mathematical basis of ring‐finding algorithms in CIDS, J Chem Doc 11 (1971), 60–63.
-
(1971)
J Chem Doc
, vol.11
, pp. 60-63
-
-
Plotkin, M.1
-
11
-
-
44949291002
-
Dominating cycles in Halin graphs
-
11 M. Skowrońska and M. M. Sysło, Dominating cycles in Halin graphs, Discr Math 86 (1990), 215–224.
-
(1990)
Discr Math
, vol.86
, pp. 215-224
-
-
Skowrońska, M.1
Sysło, M.M.2
-
12
-
-
0039129053
-
Basis systems of vector cycles with extremal properties in graphs
-
12 G. F. Stepanec, Basis systems of vector cycles with extremal properties in graphs, Uspekhi Mat Nauk II 19 (1964), 171–175. (Russian).
-
(1964)
Uspekhi Mat Nauk II
, vol.19
, pp. 171-175
-
-
Stepanec, G.F.1
-
13
-
-
0038099471
-
On Halin graphs, in: Graph theory, Proc. Conf., Lagow/Pol.
-
13 M. M. Sysło and A. Prokurowski, On Halin graphs, In: Graph theory, Proc. Conf., Lagow/Pol., volume 1018 of Lecture Notes Math, New York, Springer, 1983, pp. 248–256.
-
(1983)
, pp. 248-256
-
-
Sysło, M.M.1
Prokurowski, A.2
-
14
-
-
13744260090
-
Union of all the minimum cycle bases of a graph
-
14 P. Vismara, Union of all the minimum cycle bases of a graph, Electr J Comb 4 (1997), 73–87. Paper No. #R9 (15 pages).
-
(1997)
Electr J Comb
, vol.4
, pp. 73-87
-
-
Vismara, P.1
-
15
-
-
0040558817
-
Theory of finite graphs
-
15 A. A. Zykov, Theory of finite graphs, Nauka, Novosibirsk. (Russian), 1969.
-
(1969)
-
-
Zykov, A.A.1
|
