Charles H. C. Little

Publication Activity (10 Years)

Years Active: 1972-2020
Publications (10 Years): 1

Top Topics

Bipartite Graph

Connected Regions

Top Venues

Electron. J. Comb.

Publications

Nishad Kothari, Marcelo Henriques de Carvalho, Claudio L. Lucchesi, Charles H. C. Little
On Essentially 4-Edge-Connected Cubic Bricks. Electron. J. Comb. 27 (1) (2020)
Marcelo Henriques de Carvalho, Charles H. C. Little
Matching Covered Graphs with Three Removable Classes. Electron. J. Comb. 21 (2) (2014)
Marcelo Henriques de Carvalho, Charles H. C. Little
The Parity of a Thicket. Electron. J. Comb. 21 (2) (2014)
Xiumei Wang, Yixun Lin, Marcelo Henriques de Carvalho, Cláudio Leonardo Lucchesi, G. Sanjith, Charles H. C. Little
A characterization of PM-compact bipartite and near-bipartite graphs. Discret. Math. 313 (6) (2013)
Charles H. C. Little, Andrew Vince
Parity Versions of 2-Connectedness. Electron. J. Comb. 13 (1) (2006)
Sven Hartmann, Charles H. C. Little
Even Bonds of Prescribed Directed Parity. Electron. J. Comb. 12 (2005)
Feng Ming Dong, Michael D. Hendy, Kee L. Teo, Charles H. C. Little
Graph-functions associated with an edge-property. Australas. J Comb. 30 (2004)
Feng Ming Dong, Kee L. Teo, Charles H. C. Little, Michael D. Hendy, Khee Meng Koh
Chromatically Unique Multibridge Graphs. Electron. J. Comb. 11 (1) (2004)
Serguei Norine, Charles H. C. Little, Kee L. Teo
A new proof of a characterisation of Pfaffian bipartite graphs. J. Comb. Theory, Ser. B 91 (1) (2004)
Ilse Fischer, Charles H. C. Little
Even Circuits of Prescribed Clockwise Parity. Electron. J. Comb. 10 (2003)
Feng Ming Dong, Kee L. Teo, Charles H. C. Little, Michael D. Hendy
Two invariants for adjointly equivalent graphs. Australas. J Comb. 25 (2002)
Feng Ming Dong, Michael D. Hendy, Kee L. Teo, Charles H. C. Little
The vertex-cover polynomial of a graph. Discret. Math. 250 (1-3) (2002)
Feng Ming Dong, Kee L. Teo, Charles H. C. Little, Michael D. Hendy
Chromaticity of some families of dense graphs. Discret. Math. 258 (1-3) (2002)
Charles H. C. Little, Franz Rendl, Ilse Fischer
Towards a characterisation of Pfaffian near bipartite graphs. Discret. Math. 244 (1-3) (2002)
Feng Ming Dong, Kee L. Teo, Charles H. C. Little, Michael D. Hendy
Zeros of adjoint polynomials of paths and cycles. Australas. J Comb. 25 (2002)
Ilse Fischer, Charles H. C. Little
A Characterisation of Pfaffian Near Bipartite Graphs. J. Comb. Theory, Ser. B 82 (2) (2001)
Feng Ming Dong, Khee Meng Koh, Kee L. Teo, Charles H. C. Little, Michael D. Hendy
Chromatically unique bipartite graphs with low 3-independent partition numbers. Discret. Math. 224 (1-3) (2000)
Feng Ming Dong, Khee Meng Koh, Kee L. Teo, Charles H. C. Little, Michael D. Hendy
An attempt to classify bipartite graphs by chromatic polynomials. Discret. Math. 222 (1-3) (2000)
Charles H. C. Little, Kee L. Teo, Hong Wang
On a Conjecture on Directed Cycles in a Directed Bipartite Graph. Graphs Comb. 13 (3) (1997)
Charles H. C. Little, Bruce van Brunt
A Condition for a Normal Semicycle to Separate an Orientable 3-Graph. DMTCS (1996)
Hong Wang, Charles H. C. Little, Kee L. Teo
Partition of a directed bipartite graph into two directed cycles. Discret. Math. 160 (1-3) (1996)
Dan Archdeacon, C. Paul Bonnington, Charles H. C. Little
An algebraic characterization of planar graphs. J. Graph Theory 19 (2) (1995)
Charles H. C. Little, Hong Wang
Vertex disjoint cycles in a directed graph. Australas. J Comb. 12 (1995)
C. Paul Bonnington, Charles H. C. Little
A combinatorial generalisation of the Jordan curve theorem. Australas. J Comb. 9 (1994)
Roger B. Eggleton, Derek A. Holton, Charles H. C. Little
Cycles and paths in multigraphs. Australas. J Comb. 5 (1992)
Dan Archdeacon, C. Paul Bonnington, Charles H. C. Little
Cycles, Cocycles and Diagonals: A Characterization of Planar Graphs. Planar Graphs (1991)
C. Paul Bonnington, Charles H. C. Little
A Generalisation of MacLane's Theorem to 3-graphs. Planar Graphs (1991)
Andrew Vince, Charles H. C. Little
Discrete Jordan Curve Theorems. J. Comb. Theory, Ser. B 47 (3) (1989)
Charles H. C. Little
Cubic combinatorial maps. J. Comb. Theory, Ser. B 44 (1) (1988)
Charles H. C. Little, Derek A. Holton
No graph has a maximal 3-ring of bonds. J. Comb. Theory, Ser. B 38 (2) (1985)
Mark N. Ellingham, Derek A. Holton, Charles H. C. Little
Cycles through ten vertices in 3-connected cubic graphs. Comb. 4 (4) (1984)
Lowell W. Beineke, Charles H. C. Little
Cycles in bipartite tournaments. J. Comb. Theory, Ser. B 32 (2) (1982)
Derek A. Holton, Charles H. C. Little
Regular odd rings and non-planar graphs. Comb. 2 (2) (1982)
Charles H. C. Little
A characterization of planar cubic graphs. J. Comb. Theory, Ser. B 29 (2) (1980)
Charles H. C. Little, Douglas D. Grant, Derek A. Holton
On defect-d matchings in graphs. Discret. Math. 13 (1) (1975)
Charles H. C. Little
The parity of the number of 1-factors of a graph. Discret. Math. 2 (2) (1972)