Charles Huw Crawford Little

Possui graduação em Mathematics pela University of Toronto(1968), mestrado em Computer Science pela University of Toronto(1969) e doutorado em Combinatorics pela University of Waterloo(1973).

Informações coletadas do Lattes em 10/11/2022

Acadêmico

Formação acadêmica

Doutorado em Combinatorics

1969 - 1973

University of Waterloo
Título: On Kasteleyn's Method of Enumerating the 1-Factors of a Graph
Orientador: xxxx

Mestrado em Computer Science

1967 - 1969

University of Toronto
Orientador: xxxxx

Graduação em Mathematics

1967 - 1968

University of Toronto

Produções bibliográficas

LITTLE, Charles H C ; NORINE, S ; TEO, K L . A new proof of a characterisation of Pfaffian bipartite graphs. Journal of Combinatorial Theory. Series B , v. 91, n.1, p. 123-126, 2004.
LITTLE, Charles H C . Chromatically unique multibridge graphs. Eletronic Journal of combinatorics, v. 11, n.1, 2004.
LITTLE, Charles H C ; FISHER, Ilse . Even circuits of prescribed clockwise parity. Eletronic Journal Of Combinatorics, v. 10, n.1, p. 1-20, 2003.
LITTLE, Charles H C ; DONG, F M ; TEO, K L ; HENDY, M D . Chromaticity of some families of dense graphs. Discrete Mathematics , v. 258, p. 303-321, 2002.
LITTLE, Charles H C ; DONG, F M ; HENDY, M D ; TEO, K L . The vertex-cover polynomial of a graph. Discrete Mathematics , v. 250, p. 71-78, 2002.
LITTLE, Charles H C ; RENDL, F ; FISHER, Ilse . Towards a characterisation of Pfaffian near bipartite graphs. Discrete Mathematics , v. 244, p. 279-297, 2002.
LITTLE, Charles H C ; FISHER, Ilse . A characterization of Pfaffian near bipartite graphs. Journal of Combinatorial Theory. Series B , v. 82, p. 175-222, 2001.
LITTLE, Charles H C ; DONG, F M ; KOH, K M ; TEO, K L ; HENDY, M D . Sharp bounds for the number of 3-independent partitions and chromaticity of bipartite graphs. Journal of Graph Theory , v. 37, p. 48-77, 2001.
LITTLE, Charles H C ; DONG, F M ; KOH, K M ; TEO, K L ; HENDY, M D . Chromatically unique bipartite graphs with low 3-independent partition numbers. Discrete Mathematics , v. 224, p. 107-124, 2000.
LITTLE, Charles H C ; DONG, F M ; KOH, K M ; TEO, K L ; HENDY, M D . An attempt to classify bipartite graphs by chromatic polynomials. Discrete Mathematics , v. 222, p. 73-88, 2000.
LITTLE, Charles H C ; CAMPBELL, A. E. . Evolutionary family of sets. Eletronic Journal of Combinatorics, v. 7, n.1, 2000.
LITTLE, Charles H C ; ARCHDEACON, D ; HARTSFIELD, N ; MOHAR, B . Obstruction sets for outer-projective-planar graphs. ars combinatoria, v. 49, p. 113-127, 1998.
LITTLE, Charles H C ; WANG, H ; TEO, K L . On a conjecture on directed cycles in a directed bipartite graph. Graphs and Combinatorics , v. 13, p. 267-273, 1997.
LITTLE, Charles H C ; PENG, Y H ; TEO, K L ; WANG, H . Chromatic equivalence classes of certain generalized polygon trees. Discrete Mathematics , v. 172, p. 103-114, 1997.
LITTLE, Charles H C ; WANG, H ; TEO, K L . Partition of a directed bipartite graph into two directed cycles. Discrete Mathematics , v. 160, p. 283-289, 1996.
LITTLE, Charles H C ; ARCHDEACON, D ; HARTSFIELD, N . Nonhamiltonian triangulations with large connectivity and representativity. Journal of Combinatorial Theory. Series B , v. 68, p. 45-55, 1996.
LITTLE, Charles H C ; ARCHDEACON, D ; BONNINGTON, C P . An algebraic characterization of planar graphs. Journal of Graph Theory , v. 19, p. 237-250, 1995.
LITTLE, Charles H C ; RENDL, F . Operations preserving the Pfaffian property of a graph. Journal of the Australian Mathematical Society Series A-Pure Mathematics and Statistics , v. 50, p. 248-257, 1991.
LITTLE, Charles H C ; RINSMA, I ; WOODALL, D R . Maximal matchings in graphs with large neighborhoods of independent vertices. Journal of Graph Theory , v. 14, p. 167-171, 1990.
LITTLE, Charles H C ; RENDL, F . An algorithm for the ear decomposition of a 1-factor covered graph. Journal of the Australian Mathematical Society Series A-Pure Mathematics and Statistics , v. 46, p. 296-301, 1989.
LITTLE, Charles H C ; VINCE, A . Discrete Jordan curve theorems. Journal of Combinatorial Theory. Series B , v. 47, p. 251-261, 1989.
LITTLE, Charles H C ; YOUNGER, D ; TUTTE, W T . A theorem on integer flows. Ars Combinatoria , v. 26, p. 109-112, 1988.
LITTLE, Charles H C . Cubic combinatorial maps. Journal of Combinatorial Theory. Series B , v. 44, p. 44-63, 1988.
LITTLE, Charles H C ; MCCALL, J . The Hadamard conjecture and integer lattices. Journal of the Australian Mathematical Society Series A-Pure Mathematics and Statistics , v. 43, p. 257-267, 1987.
LITTLE, Charles H C . An analogue of the Hadamard conjecture for nxn matrices with n=2 (mod 4). Journal of the Australian Mathematical Society Series A-Pure Mathematics and Statistics , v. 42, p. 287-295, 1987.
LITTLE, Charles H C . Another characterisation of Pfaffian bipartite graphs. Journal of the Australian Mathematical Society Series A-Pure Mathematics and Statistics , v. 38, p. 132-142, 1985.
LITTLE, Charles H C ; HOLTON, D A . No graph has a maximal 3-ring of bonds. Journal of Combinatorial Theory. Series B , v. 38, p. 139-142, 1985.
LITTLE, Charles H C ; ELLINGHAM, M N ; HOLTON, D A . Cycles through ten vertices in 3-connected cubic graphs. Combinatorica , v. 4, p. 265-273, 1984.
LITTLE, Charles H C ; HENDY, M D . The Hadamard conjecture and bases for the cycle space of K4s,4s. Ars Combinatoria , v. 17, p. 231-240, 1984.
LITTLE, Charles H C ; HENDY, M D ; PENNY, D . Comparing trees with pendant vertices labelled. SIAM Journal on Applied Mathematics , v. 44, p. 1054-1065, 1984.
LITTLE, Charles H C . A generalisation of a recent characterisation of planar graphs. Bulletin of the Australian Mathematical Society , v. 27, p. 225-230, 1983.
LITTLE, Charles H C ; HOLTON, D A . Regular odd rings and non-planar graphs. Combinatorica , v. 2, p. 149-152, 1982.
LITTLE, Charles H C ; HOLTON, D A . Rings of bonds in graphs. Journal of Combinatorial Theory. Series B , v. 33, p. 1-6, 1982.
LITTLE, Charles H C ; BEINEKE, L W . Cycles in bipartite tournaments. Journal of Combinatorial Theory. Series B , v. 32, p. 140-145, 1982.
LITTLE, Charles H C ; THUENTE, D . The Hadamard conjecture and circuits of length four in a complete bipartite graph. Journal of the Australian Mathematical Society Series A-Pure Mathematics and Statistics , v. 31, p. 252-256, 1981.
LITTLE, Charles H C . A characterization of planar cubic graphs. Journal of Combinatorial Theory. Series B , v. 29, p. 185-194, 1980.
LITTLE, Charles H C ; RINGEISEN, R D . An additivity theorem for maximum genus of a graph. Discrete Mathematics , v. 21, p. 69-74, 1978.
LITTLE, Charles H C ; HOLTON, D A . A new characterization of planar graphs. Bulletin, New Series, of the American Mathematical Society , v. 83, p. 137-138, 1977.
LITTLE, Charles H C . On the number of parity sets in a graph. Canadian Journal of Mathematics , v. 28, p. 1167-1171, 1976.
LITTLE, Charles H C . A short proof of a recent theorem of G Szekeres. Journal of the Australian Mathematical Society Series A-Pure Mathematics and Statistics , v. 21, p. 277-277, 1976.
LITTLE, Charles H C ; GRANT, D D ; HOLTON, D A . On defect-d matchings in graphs. Discrete Mathematics , v. 13, p. 41-54, 1975.
LITTLE, Charles H C . A characterization of convertible (0,1)-matrices. Journal of Combinatorial Theory. Series B , v. 18, p. 187-208, 1975.
LITTLE, Charles H C . A theorem on connected graphs in which every edge belongs to a 1-factor. Journal of the Australian Mathematical Society Series A-Pure Mathematics and Statistics , v. 18, p. 450-452, 1974.
LITTLE, Charles H C . Kasteleyn's theorem and arbitrary graphs. Canadian Journal of Mathematics , v. 25, p. 758-764, 1973.
LITTLE, Charles H C . The parity of the number of 1-factors of a graph. Discrete Mathematics , v. 2, p. 179-181, 1972.
LITTLE, Charles H C ; TEO, K L ; BRUNT, B Van . The Number Systems of Analysis. Singapura: World Scientific, 2003. v. 1. 130p .
LITTLE, Charles H C ; BONNINGTON, C P . The Foundations of Topological Graph Theory. New York: , 1995. v. 1.

Histórico profissional

Experiência profissional

Sem data

Massey University