SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Combinatorics Probability and Computing

Volumn 5, Issue 1, 1996, Pages 57-78

Excluding minors in cubic graphs

(2) Kilakos, K a Shepherd, B a

a LONDON SCHOOL OF ECONOMICS (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030556692 PISSN: 09635483 EISSN: None Source Type: Journal
DOI: 10.1017/S0963548300001838 Document Type: Article

Times cited : (3)

References (16)

1
- 17644414892
- Submitted
- Alspach, B., Goddyn, L. A. and Zhang, C. Q. (1996) Graphs with the circuit cover property. Submitted.
- (1996) Graphs with the Circuit Cover Property
- Alspach, B.¹ Goddyn, L.A.² Zhang, C.Q.³

2
- 84972498411
- Every planar map is four-colourable, part I: Discharging
- Appel, K. and Haken, W. (1977) Every planar map is four-colourable, part I: discharging, Illinois J. Math. 21 429-490.
- (1977) Illinois J. Math. , vol.21 , pp. 429-490
- Appel, K.¹ Haken, W.²

3
- 84972500815
- Every planar map is four-colourable, part II: Reducibility
- Appel, K., Haken, W. and Koch, J. (1977) Every planar map is four-colourable, part II: reducibility. Illinois J. Math. 21 491-567.
- (1977) Illinois J. Math. , vol.21 , pp. 491-567
- Appel, K.¹ Haken, W.² Koch, J.³

4
- 0001214263
- Maximum matching and a polyhedron with (0,1) vertices
- Edmonds, J. (1965) Maximum matching and a polyhedron with (0,1) vertices. J. Res. Nat. Bur. Standards Sect. B, 69B 125-130.
- (1965) J. Res. Nat. Bur. Standards Sect. B , vol.69 B , pp. 125-130
- Edmonds, J.¹

5
- 0009106556
- Petersen subdivisions in some regular graphs
- Ellingham, M. N. (1984) Petersen subdivisions in some regular graphs. Congressus Numerantium 44 33-40.
- (1984) Congressus Numerantium , vol.44 , pp. 33-40
- Ellingham, M.N.¹

6
- 0001170097
- Graphes 4-essentiels
- Fontet, M. (1978) Graphes 4-essentiels. C.R. Acad. Sci. Paris t287 289-290.
- (1978) C.R. Acad. Sci. Paris , vol.287 , pp. 289-290
- Fontet, M.¹

7
- 85033015891
- Cones, lattices and Hubert bases of circuits and perfect matchings
- to appear
- Goddyn, L. A. (1996) Cones, lattices and Hubert bases of circuits and perfect matchings. Contemporary Mathematics (to appear).
- (1996) Contemporary Mathematics
- Goddyn, L.A.¹

8
- 0000429528
- The NP-completeness of edge-colouring
- Holyer, I. (1981) The NP-completeness of edge-colouring. SIAM J. Computing 10 718-720.
- (1981) SIAM J. Computing , vol.10 , pp. 718-720
- Holyer, I.¹

9
- 0009230361
- On 3-connected graphs without essential 3-cuts or triangles
- Kelmans, A. K. (1986) On 3-connected graphs without essential 3-cuts or triangles. Soviet Math. Dokl. 33(3) 698-703.
- (1986) Soviet Math. Dokl. , vol.33 , Issue.3 , pp. 698-703
- Kelmans, A.K.¹

10
- 0001347227
- Matching structure and the matching lattice
- Lovász, L. (1987) Matching structure and the matching lattice. J. Combinatorial Theory (B) 43 187-222.
- (1987) J. Combinatorial Theory (B) , vol.43 , pp. 187-222
- Lovász, L.¹

11
- 0001195983
- On multi-colourings of cubic graphs and conjectures of Fulkerson and Tutte
- Seymour, P. D. (1979) On multi-colourings of cubic graphs and conjectures of Fulkerson and Tutte. Proc. London Math. Society (3) 38 423-460.
- (1979) Proc. London Math. Society , vol.3 , pp. 38423-38460
- Seymour, P.D.¹

12
- 33644561816
- On Tutte's extension of the four-colour problem
- Seymour, P. D. (1981) On Tutte's extension of the four-colour problem. J. Combinatorial Theory (B) 31 82-94.
- (1981) J. Combinatorial Theory (B) , vol.31 , pp. 82-94
- Seymour, P.D.¹

13
- 0000338028
- Remarks on the colouring of maps
- Tait, P. G. (1880) Remarks on the colouring of maps. Proc. Royal Soc. Edinburgh, Ser. A 10 729.
- (1880) Proc. Royal Soc. Edinburgh, Ser. A , vol.10 , pp. 729
- Tait, P.G.¹

14
- 0002055748
- On the algebraic theory of graph colourings
- Tutte, W. T. (1966) On the algebraic theory of graph colourings. J. Combinatorial Theory (B) 23 15-50.
- (1966) J. Combinatorial Theory (B) , vol.23 , pp. 15-50
- Tutte, W.T.¹

15
- 33845337775
- Über eine Eigenschaft der ebenen Komplexe
- Wagner, K. (1937) Über eine Eigenschaft der ebenen Komplexe. Math. Ann. 114 570-590.
- (1937) Math. Ann. , vol.114 , pp. 570-590
- Wagner, K.¹

16
- 0041404688
- Classifying k-connected cubic graphs
- Springer Verlag
- Wormald, N. C. (1979) Classifying k-connected cubic graphs. Lecture Notes in Mathematics 748. Springer Verlag, 199-206.
- (1979) Lecture Notes in Mathematics , vol.748 , pp. 199-206
- Wormald, N.C.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.