Charles H. C. Little

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
On Essentially 4-Edge-Connected Cubic Bricks.
Electron. J. Comb., 2020

2016
A characterization of minimal non-Seymour graphs.
Discret. Math., 2016

2014
The Parity of a Thicket.
Electron. J. Comb., 2014

Matching Covered Graphs with Three Removable Classes.
Electron. J. Comb., 2014

2013
A characterization of PM-compact bipartite and near-bipartite graphs.
Discret. Math., 2013

2010
Another Characterisation of Planar Graphs.
Electron. J. Comb., 2010

2009
Circuit decompositions of join-covered graphs.
J. Graph Theory, 2009

2008
Ear Decompositions in Combed Graphs.
Electron. J. Comb., 2008

Vector Spaces and the Petersen Graph.
Electron. J. Comb., 2008

2006
Parity Versions of 2-Connectedness.
Electron. J. Comb., 2006

2005
Even Bonds of Prescribed Directed Parity.
Electron. J. Comb., 2005

2004
A new proof of a characterisation of Pfaffian bipartite graphs.
J. Comb. Theory B, 2004

Chromatically Unique Multibridge Graphs.
Electron. J. Comb., 2004

Graph-functions associated with an edge-property.
Australas. J Comb., 2004

2003
Even Circuits of Prescribed Clockwise Parity.
Electron. J. Comb., 2003

2002
Towards a characterisation of Pfaffian near bipartite graphs.
Discret. Math., 2002

Chromaticity of some families of dense graphs.
Discret. Math., 2002

The vertex-cover polynomial of a graph.
Discret. Math., 2002

Zeros of adjoint polynomials of paths and cycles.
Australas. J Comb., 2002

Two invariants for adjointly equivalent graphs.
Australas. J Comb., 2002

2001
Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs.
J. Graph Theory, 2001

A Characterisation of Pfaffian Near Bipartite Graphs.
J. Comb. Theory B, 2001

2000
An attempt to classify bipartite graphs by chromatic polynomials.
Discret. Math., 2000

Chromatically unique bipartite graphs with low 3-independent partition numbers.
Discret. Math., 2000

Evolutionary Familes of Sets.
Electron. J. Comb., 2000

1999
On the principal edge bipartition of a graph.
Australas. J Comb., 1999

1998
Obstruction Sets for Outer-Projective-Planar Graphs.
Ars Comb., 1998

1997
On a Conjecture on Directed Cycles in a Directed Bipartite Graph.
Graphs Comb., 1997

Chromatic equivalence classes of certain generalized polygon trees.
Discret. Math., 1997

1996
Nonhamiltonian Triangulations with Large Connectivity and Representativity.
J. Comb. Theory, Ser. B, 1996

Partition of a directed bipartite graph into two directed cycles.
Discret. Math., 1996

A Condition for a Normal Semicycle to Separate an Orientable 3-Graph.
Proceedings of the First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, 1996

1995
An algebraic characterization of planar graphs.
J. Graph Theory, 1995

Vertex disjoint cycles in a directed graph.
Australas. J Comb., 1995

1994
A combinatorial generalisation of the Jordan curve theorem.
Australas. J Comb., 1994

1992
Cycles and paths in multigraphs.
Australas. J Comb., 1992

The classification of combinatorial surfaces using 3-graphs.
Australas. J Comb., 1992

1991
A Generalisation of MacLane's Theorem to 3-graphs.
Proceedings of the Planar Graphs, 1991

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

1990
Maximal matchings in graphs with large neighborhoods of independent vertices.
J. Graph Theory, 1990

1989
Discrete Jordan Curve Theorems.
J. Comb. Theory B, 1989

1988
Cubic combinatorial maps.
J. Comb. Theory B, 1988

1985
No graph has a maximal 3-ring of bonds.
J. Comb. Theory B, 1985

1984
Cycles through ten vertices in 3-connected cubic graphs.
Comb., 1984

1982
Cycles in bipartite tournaments.
J. Comb. Theory B, 1982

Regular odd rings and non-planar graphs.
Comb., 1982

1980
A characterization of planar cubic graphs.
J. Comb. Theory B, 1980

1978
An additivity theorem for maximum genus of a graph.
Discret. Math., 1978

1975
On defect-d matchings in graphs.
Discret. Math., 1975

1972
The parity of the number of 1-factors of a graph.
Discret. Math., 1972


  Loading...