Charles H. C. Little

According to our database, Charles H. C. Little authored at least 50 papers between 1972 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2020

On Essentially 4-Edge-Connected Cubic Bricks.

Nishad Kothari, Marcelo Henriques de Carvalho, Claudio L. Lucchesi, Charles H. C. Little

Electron. J. Comb., 2020

2016

A characterization of minimal non-Seymour graphs.

Marcelo Henriques de Carvalho, C. H. C. Little

Discret. Math., 2016

2014

The Parity of a Thicket.

Marcelo Henriques de Carvalho, Charles H. C. Little

Electron. J. Comb., 2014

Matching Covered Graphs with Three Removable Classes.

Marcelo Henriques de Carvalho, Charles H. C. Little

Electron. J. Comb., 2014

2013

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

Xiumei Wang, Yixun Lin, Marcelo Henriques de Carvalho, Cláudio Leonardo Lucchesi, G. Sanjith, Charles H. C. Little

Discret. Math., 2013

2010

Another Characterisation of Planar Graphs.

C. H. C. Little, G. Sanjith

Electron. J. Comb., 2010

2009

Circuit decompositions of join-covered graphs.

Marcelo Henriques de Carvalho, C. H. C. Little

J. Graph Theory, 2009

2008

Ear Decompositions in Combed Graphs.

Marcelo Henriques de Carvalho, C. H. C. Little

Electron. J. Comb., 2008

Vector Spaces and the Petersen Graph.

Marcelo Henriques de Carvalho, C. H. C. Little

Electron. J. Comb., 2008

2006

Parity Versions of 2-Connectedness.

Charles H. C. Little, Andrew Vince

Electron. J. Comb., 2006

2005

Even Bonds of Prescribed Directed Parity.

Sven Hartmann, Charles H. C. Little

Electron. J. Comb., 2005

2004

A new proof of a characterisation of Pfaffian bipartite graphs.

Serguei Norine, Charles H. C. Little, Kee L. Teo

J. Comb. Theory, Ser. B, 2004

Chromatically Unique Multibridge Graphs.

Feng Ming Dong, Kee L. Teo, Charles H. C. Little, Michael D. Hendy, Khee Meng Koh

Electron. J. Comb., 2004

Graph-functions associated with an edge-property.

Feng Ming Dong, Michael D. Hendy, Kee L. Teo, Charles H. C. Little

Australas. J Comb., 2004

2003

Even Circuits of Prescribed Clockwise Parity.

Ilse Fischer, Charles H. C. Little

Electron. J. Comb., 2003

2002

Towards a characterisation of Pfaffian near bipartite graphs.

Charles H. C. Little, Franz Rendl, Ilse Fischer

Discret. Math., 2002

Chromaticity of some families of dense graphs.

Feng Ming Dong, Kee L. Teo, Charles H. C. Little, Michael D. Hendy

Discret. Math., 2002

The vertex-cover polynomial of a graph.

Feng Ming Dong, Michael D. Hendy, Kee L. Teo, Charles H. C. Little

Discret. Math., 2002

Zeros of adjoint polynomials of paths and cycles.

Feng Ming Dong, Kee L. Teo, Charles H. C. Little, Michael D. Hendy

Australas. J Comb., 2002

Two invariants for adjointly equivalent graphs.

Feng Ming Dong, Kee L. Teo, Charles H. C. Little, Michael D. Hendy

Australas. J Comb., 2002

2001

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

Feng Ming Dong, Khee Meng Koh, Kee L. Teo, C. H. C. Little, Michael D. Hendy

J. Graph Theory, 2001

A Characterisation of Pfaffian Near Bipartite Graphs.

Ilse Fischer, Charles H. C. Little

J. Comb. Theory, Ser. B, 2001

2000

An attempt to classify bipartite graphs by chromatic polynomials.

Feng Ming Dong, Khee Meng Koh, Kee L. Teo, Charles H. C. Little, Michael D. Hendy

Discret. Math., 2000

Chromatically unique bipartite graphs with low 3-independent partition numbers.

Feng Ming Dong, Khee Meng Koh, Kee L. Teo, Charles H. C. Little, Michael D. Hendy

Discret. Math., 2000

Evolutionary Familes of Sets.

C. H. C. Little, A. E. Campbell

Electron. J. Comb., 2000

1999

On the principal edge bipartition of a graph.

Michael A. Henning, C. H. C. Little

Australas. J Comb., 1999

1998

Obstruction Sets for Outer-Projective-Planar Graphs.

Dan Archdeacon, Nora Hartsfield, C. H. C. Little, Bojan Mohar

Ars Comb., 1998

1997

On a Conjecture on Directed Cycles in a Directed Bipartite Graph.

Charles H. C. Little, Kee L. Teo, Hong Wang

Graphs Comb., 1997

Chromatic equivalence classes of certain generalized polygon trees.

Yee-Hock Peng, C. H. C. Little, Kee L. Teo, Hong Wang

Discret. Math., 1997

1996

Nonhamiltonian Triangulations with Large Connectivity and Representativity.

Dan Archdeacon, Nora Hartsfield, C. H. C. Little

J. Comb. Theory, Ser. B, 1996

Partition of a directed bipartite graph into two directed cycles.

Hong Wang, Charles H. C. Little, Kee L. Teo

Discret. Math., 1996

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

Charles H. C. Little, Bruce van Brunt

Proceedings of the First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, 1996

1995

An algebraic characterization of planar graphs.

Dan Archdeacon, C. Paul Bonnington, Charles H. C. Little

J. Graph Theory, 1995

Vertex disjoint cycles in a directed graph.

Charles H. C. Little, Hong Wang

Australas. J Comb., 1995

1994

A combinatorial generalisation of the Jordan curve theorem.

C. Paul Bonnington, Charles H. C. Little

Australas. J Comb., 1994

1992

Cycles and paths in multigraphs.

Roger B. Eggleton, Derek A. Holton, Charles H. C. Little

Australas. J Comb., 1992

The classification of combinatorial surfaces using 3-graphs.

C. Paul Bonnington, C. H. C. Little

Australas. J Comb., 1992

1991

A Generalisation of MacLane's Theorem to 3-graphs.

C. Paul Bonnington, Charles H. C. Little

Proceedings of the Planar Graphs, 1991

Cycles, Cocycles and Diagonals: A Characterization of Planar Graphs.

Dan Archdeacon, C. Paul Bonnington, Charles H. C. Little

Proceedings of the Planar Graphs, 1991

1990

Maximal matchings in graphs with large neighborhoods of independent vertices.

I. Rinsma, C. H. C. Little, Douglas R. Woodall

J. Graph Theory, 1990

1989

Discrete Jordan Curve Theorems.

Andrew Vince, Charles H. C. Little

J. Comb. Theory, Ser. B, 1989

1988

Cubic combinatorial maps.

Charles H. C. Little

J. Comb. Theory, Ser. B, 1988

1985

No graph has a maximal 3-ring of bonds.

Charles H. C. Little, Derek A. Holton

J. Comb. Theory, Ser. B, 1985

1984

Cycles through ten vertices in 3-connected cubic graphs.

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

Comb., 1984

1982

Cycles in bipartite tournaments.

Lowell W. Beineke, Charles H. C. Little

J. Comb. Theory, Ser. B, 1982

Regular odd rings and non-planar graphs.

Derek A. Holton, Charles H. C. Little

Comb., 1982

1980

A characterization of planar cubic graphs.

Charles H. C. Little

J. Comb. Theory, Ser. B, 1980

1978

An additivity theorem for maximum genus of a graph.

C. H. C. Little, Richard D. Ringeisen

Discret. Math., 1978

1975

On defect-d matchings in graphs.

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

Discret. Math., 1975

1972

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

Charles H. C. Little

Discret. Math., 1972