E-LIB Suche - Ergebnisse für: Little, J. C.

1

A characterization of minimal non-Seymour graphs:

de Carvalho, M.H. ; Little, C.H.C.
Discrete Mathematics. 339 (2016) 2 - p. 547-559 , 2016

Link: https://doi.org/10.1016/..

2

A characterization of PM-compact bipartite and near-biparti..:

Wang, Xiumei ; Lin, Yixun ; Carvalho, Marcelo H....
Discrete Mathematics. 313 (2013) 6 - p. 772-783 , 2013

Link: https://doi.org/10.1016/..

3

Circuit decompositions of join‐covered graphs:

de Carvalho, Marcelo H. ; Little, C. H. C.
Journal of Graph Theory. 62 (2009) 3 - p. 220-233 , 2009

Link: https://doi.org/10.1002/..

4

A new proof of a characterisation of Pfaffian bipartite gra..:

Norine, Serguei ; Little, C.H.C. ; Teo, Kee L.
Journal of Combinatorial Theory, Series B. 91 (2004) 1 - p. 123-126 , 2004

Link: https://doi.org/10.1016/..

5

Chromaticity of some families of dense graphs:

Dong, F.M. ; Teo, K.L. ; Little, C.H.C..
Discrete Mathematics. 258 (2002) 1-3 - p. 303-321 , 2002

Link: https://doi.org/10.1016/..

6

The vertex-cover polynomial of a graph:

Dong, F.M. ; Hendy, M.D. ; Teo, K.L..
Discrete Mathematics. 250 (2002) 1-3 - p. 71-78 , 2002

Link: https://doi.org/10.1016/..

7

Sharp bounds for the number of 3‐independent partitions and..:

Dong, F. M. ; Koh, K. M. ; Teo, K. L...
Journal of Graph Theory. 37 (2001) 1 - p. 48-77 , 2001

Link: https://doi.org/10.1002/..

8

Chromatically unique bipartite graphs with low 3-independen..:

Dong, F.M. ; Koh, K.M. ; Teo, K.L...
Discrete Mathematics. 224 (2000) 1-3 - p. 107-124 , 2000

Link: https://doi.org/10.1016/..

9

An attempt to classify bipartite graphs by chromatic polyno..:

Dong, F.M. ; Koh, K.M. ; Teo, K.L...
Discrete Mathematics. 222 (2000) 1-3 - p. 73-88 , 2000

Link: https://doi.org/10.1016/..

10

Chromatic equivalence classes of certain generalized polygo..:

Peng, Yee-Hock ; Little, C.H.C. ; Teo, K.L..
Discrete Mathematics. 172 (1997) 1-3 - p. 103-114 , 1997

Link: https://doi.org/10.1016/..

11

Nonhamiltonian Triangulations with Large Connectivity and R..:

Archdeacon, Dan ; Hartsfield, Nora ; Little, C.H.C.
Journal of Combinatorial Theory, Series B. 68 (1996) 1 - p. 45-55 , 1996

Link: https://doi.org/10.1006/..

12

Maximal matchings in graphs with large neighborhoods of ind..:

Rinsma, I. ; Little, C. H. C. ; Woodall, D. R.
Journal of Graph Theory. 14 (1990) 2 - p. 167-171 , 1990

Link: https://doi.org/10.1002/..

13

Discrete Jordan Curve Theorems:

Vince, Andrew ; Little, C.H.C
Journal of Combinatorial Theory, Series B. 47 (1989) 3 - p. 251-261 , 1989

Link: https://doi.org/10.1016/..

14

Cubic combinatorial maps:

Little, C.H.C
Journal of Combinatorial Theory, Series B. 44 (1988) 1 - p. 44-63 , 1988

Link: https://doi.org/10.1016/..

15

No graph has a maximal 3-ring of bonds:

Little, C.H.C ; Holton, D.A
Journal of Combinatorial Theory, Series B. 38 (1985) 2 - p. 139-142 , 1985

Link: https://doi.org/10.1016/..