Charles H. C. Little

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