Charles H. C. Little

发表

Vertex disjoint cycles in a directed graph

Hong Wang, Charles H. C. Little, Hong Wang, 1995, Australas. J Comb..

Sharp bounds for the number of 3‐independent partitions and the chromaticity of bipartite graphs

Feng Ming Dong, Charles H. C. Little, Khee Meng Koh, 2001, J. Graph Theory.

Chromatically unique bipartite graphs with low 3-independent partition numbers

Feng Ming Dong, Charles H. C. Little, Khee Meng Koh, 2000, Discret. Math..

Cycles and paths in multigraphs

Roger B. Eggleton, Charles H. C. Little, Derek A. Holton, 1992, Australas. J Comb..

An additivity theorem for maximum genus of a graph

Charles H. C. Little, Richard D. Ringeisen, 1978, Discret. Math..

Cycles in bipartite tournaments

Charles H. C. Little, Lowell W. Beineke, L. Beineke, 1982, J. Comb. Theory, Ser. B.

A new proof of a characterisation of Pfaffian bipartite graphs

Charles H. C. Little, Kee L. Teo, Serguei Norine, 2004, J. Comb. Theory, Ser. B.

Cubic combinatorial maps

Charles H. C. Little, 1988, J. Comb. Theory, Ser. B.

Cycles through ten vertices in 3-connected cubic graphs

Mark N. Ellingham, Charles H. C. Little, Derek A. Holton, 1984, Comb..

Nonhamiltonian Triangulations with Large Connectivity and Representativity

Charles H. C. Little, Dan Archdeacon, Nora Hartsfield, 1996, J. Comb. Theory, Ser. B.

Mac Lane’s Theorem for 3-Graphs

Charles H. C. Little, C. Paul Bonnington, 1995 .

On defect-d matchings in graphs

Charles H. C. Little, Derek A. Holton, Douglas D. Grant, 1975, Discret. Math..

Even Circuits of Prescribed Clockwise Parity

Ilse Fischer, Charles H. C. Little, 2003, Electron. J. Comb..

Even Bonds of Prescribed Directed Parity

Sven Hartmann, Charles H. C. Little, Sven Hartmann, 2005, Electron. J. Comb..

The parity of the number of 1-factors of a graph

Charles H. C. Little, C. Little, 1972, Discret. Math..

On a Conjecture on Directed Cycles in a Directed Bipartite Graph

Hong Wang, Charles H. C. Little, Kee L. Teo, 1997, Graphs Comb..

Two invariants for adjointly equivalent graphs

Feng Ming Dong, Charles H. C. Little, Kee L. Teo, 2002, Australas. J Comb..

Towards a characterisation of Pfaffian near bipartite graphs

Franz Rendl, Ilse Fischer, Charles H. C. Little, 2002, Discret. Math..

Chromaticity of some families of dense graphs

Feng Ming Dong, Charles H. C. Little, Kee L. Teo, 2002, Discret. Math..

Graph-functions associated with an edge-property

Feng Ming Dong, Charles H. C. Little, Kee L. Teo, 2004, Australas. J Comb..

Chromatically Unique Multibridge Graphs

Feng Ming Dong, Charles H. C. Little, Khee Meng Koh, 2004, Electron. J. Comb..

Elements of Logic

Charles H. C. Little, Kee L. Teo, B van Brunt, 2003 .

The vertex-cover polynomial of a graph

Feng Ming Dong, Charles H. C. Little, Kee L. Teo, 2002, Discret. Math..

A Condition for a Normal Semicycle to Separate an Orientable 3-Graph

Charles H. C. Little, Bruce van Brunt, 1996, DMTCS.

An algebraic characterization of planar graphs

Charles H. C. Little, Dan Archdeacon, C. Paul Bonnington, 1995, J. Graph Theory.

A combinatorial generalisation of the Jordan curve theorem

Charles H. C. Little, C. Paul Bonnington, 1994, Australas. J Comb..

Chromatic equivalence classes of certain generalized polygon trees

Hong Wang, Charles H. C. Little, Kee L. Teo, 1997, Discret. Math..

On Essentially 4-Edge-Connected Cubic Bricks

Nishad Kothari, Marcelo H. de Carvalho, Charles H. C. Little, 2020, Electron. J. Comb..

Parity Versions of 2-Connectedness

Charles H. C. Little, Andrew Vince, C. Little, 2006, Electron. J. Comb..

Discrete Jordan Curve Theorems

Charles H. C. Little, Andrew Vince, 1989, J. Comb. Theory, Ser. B.

Regular odd rings and non-planar graphs

Charles H. C. Little, Derek A. Holton, 1982, Comb..

A Characterisation of Pfaffian Near Bipartite Graphs

Ilse Fischer, Charles H. C. Little, 2001, J. Comb. Theory, Ser. B.

Obstruction Sets for Outer-Projective-Planar Graphs

Bojan Mohar, Charles H. C. Little, Dan Archdeacon, 1998, Ars Comb..

Combinatorial Mathematics V

Charles H. C. Little, C. Little, 1977 .

No graph has a maximal 3-ring of bonds

Charles H. C. Little, Derek A. Holton, 1985, J. Comb. Theory, Ser. B.

A characterization of minimal non-Seymour graphs

Marcelo H. de Carvalho, Charles H. C. Little, 2016, Discret. Math..

Zeros of adjoint polynomials of paths and cycles

Feng Ming Dong, Charles H. C. Little, Kee L. Teo, 2002, Australas. J Comb..

Another Characterisation of Planar Graphs

Charles H. C. Little, G. Sanjith, C. Little, 2010, Electron. J. Comb..

The classification of combinatorial surfaces using 3-graphs

Charles H. C. Little, C. Paul Bonnington, 1992, Australas. J Comb..

The Parity of a Thicket

Marcelo H. de Carvalho, Charles H. C. Little, C. Little, 2014, Electron. J. Comb..

A characterization of planar cubic graphs

Charles H. C. Little, 1980, J. Comb. Theory, Ser. B.

A characterization of PM-compact bipartite and near-bipartite graphs

Claudio L. Lucchesi, Marcelo H. de Carvalho, Charles H. C. Little, 2013, Discret. Math..

Evolutionary Familes of Sets

Charles H. C. Little, A. E. Campbell, 2000, Electron. J. Comb..

Partition of a directed bipartite graph into two directed cycles

Hong Wang, Charles H. C. Little, Kee L. Teo, 1996, Discret. Math..

Cycles, Cocycles and Diagonals: A Characterization of Planar Graphs

Charles H. C. Little, Dan Archdeacon, C. Paul Bonnington, 1991, Planar Graphs.

Maximal matchings in graphs with large neighborhoods of independent vertices

Douglas R. Woodall, Charles H. C. Little, I. Rinsma, 1990, J. Graph Theory.

On the principal edge bipartition of a graph

Michael A. Henning, Charles H. C. Little, 1999, Australas. J Comb..

An attempt to classify bipartite graphs by chromatic polynomials

Feng Ming Dong, Charles H. C. Little, Khee Meng Koh, 2000, Discret. Math..

The Real Number System

Charles H. C. Little, Kee L. Teo, B van Brunt, 2003 .

Ear Decompositions in Combed Graphs

Marcelo H. de Carvalho, Charles H. C. Little, 2008, Electron. J. Comb..

A Generalisation of MacLane's Theorem to 3-graphs

Charles H. C. Little, C. Paul Bonnington, 1991, Planar Graphs.

Matching Covered Graphs with Three Removable Classes

Marcelo H. de Carvalho, Charles H. C. Little, 2014, Electron. J. Comb..

Circuit decompositions of join-covered graphs

Marcelo H. de Carvalho, Charles H. C. Little, 2009, J. Graph Theory.

Vector Spaces and the Petersen Graph

Marcelo H. de Carvalho, Charles H. C. Little, C. Little, 2008, Electron. J. Comb..

A theorem on planar graphs

Charles H. C. Little, 1976 .

Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs

Kok Lay Teo, Fengming Dong, Charles H. C. Little, 2001 .

Circuit decompositions of join-covered graphs

Marcelo H. de Carvalho, Charles H. C. Little, 2009 .

An Extension of kasteleyn's method of enumerating the 1-factors of planar graphs

Charles H. C. Little, C. Little, 1974 .

On rings of circuits in planar graphs

Charles H. C. Little, 1977 .

On graphs as unions of eulerian graphs

Charles H. C. Little, 1978 .

A theorem on connected graphs in which every edge belongs to a 1-factor

Charles H. C. Little, C. Little, 1974, Journal of the Australian Mathematical Society.

The Foundations of Topological Graph Theory

Charles H. C. Little, C. Paul Bonnington, C. Little, 1995 .