Charles H. C. Little

From MaRDI portal
Person:405202

Available identifiers

zbMath Open little.charles-h-cMaRDI QIDQ405202

List of research outcomes

PublicationDate of PublicationType
An Introduction to Infinite Products2021-12-06Paper
On essentially 4-edge-connected cubic bricks2020-01-27Paper
A characterization of minimal non-Seymour graphs2015-12-08Paper
Real Analysis via Sequences and Series2015-04-07Paper
Matching covered graphs with three removable classes2014-09-04Paper
The parity of a thicket2014-09-04Paper
A characterization of PM-compact bipartite and near-bipartite graphs2013-03-19Paper
Another characterisation of planar graphs2010-03-26Paper
Circuit decompositions of join-covered graphs2009-12-18Paper
Vector spaces and the Petersen graph2009-04-07Paper
Ear decompositions in combed graphs2009-04-07Paper
Even bonds of prescribed directed parity2006-01-17Paper
https://portal.mardi4nfdi.de/entity/Q48205232004-10-15Paper
A new proof of a characterisation of Pfaffian bipartite graphs2004-08-06Paper
Even circuits of prescribed clockwise parity2004-02-05Paper
Chromatically unique multibridge graphs2004-02-05Paper
https://portal.mardi4nfdi.de/entity/Q44371392003-12-07Paper
A characterisation of Pfaffian near bipartite graphs2002-12-10Paper
Chromaticity of some families of dense graphs2002-12-02Paper
https://portal.mardi4nfdi.de/entity/Q45295182002-09-20Paper
The vertex-cover polynomial of a graph2002-08-29Paper
Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs2002-06-30Paper
https://portal.mardi4nfdi.de/entity/Q45295202002-06-10Paper
Towards a characterisation of Pfaffian near bipartite graphs2002-05-21Paper
https://portal.mardi4nfdi.de/entity/Q27782642002-03-13Paper
Chromatically unique bipartite graphs with low 3-independent partition numbers2001-06-28Paper
https://portal.mardi4nfdi.de/entity/Q27136082001-06-10Paper
https://portal.mardi4nfdi.de/entity/Q42694342001-02-18Paper
https://portal.mardi4nfdi.de/entity/Q45264012001-01-16Paper
An attempt to classify bipartite graphs by chromatic polynomials2000-09-14Paper
Evolutionary families of sets2000-03-12Paper
https://portal.mardi4nfdi.de/entity/Q42176051999-06-08Paper
Nonhamiltonian triangulations with large connectivity and representativity1997-09-25Paper
https://portal.mardi4nfdi.de/entity/Q48580921995-12-12Paper
https://portal.mardi4nfdi.de/entity/Q48581501995-12-12Paper
An algebraic characterization of planar graphs1995-03-20Paper
https://portal.mardi4nfdi.de/entity/Q43043281995-01-10Paper
https://portal.mardi4nfdi.de/entity/Q31382811994-06-06Paper
https://portal.mardi4nfdi.de/entity/Q31382841994-01-02Paper
https://portal.mardi4nfdi.de/entity/Q40171411993-01-16Paper
https://portal.mardi4nfdi.de/entity/Q40171481993-01-16Paper
https://portal.mardi4nfdi.de/entity/Q39781111992-06-25Paper
Maximal matchings in graphs with large neighborhoods of independent vertices1992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q34817211990-01-01Paper
Discrete Jordan curve theorems1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38266141989-01-01Paper
Cubic combinatorial maps1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38233931988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37623521987-01-01Paper
No graph has a maximal 3-ring of bonds1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36884341985-01-01Paper
Cycles through ten vertices in 3-connected cubic graphs1984-01-01Paper
Comparing Trees with Pendant Vertices Labelled1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33221251984-01-01Paper
A generalisation of a recent characterisation of planar graphs1983-01-01Paper
Rings of bonds in graphs1982-01-01Paper
Regular odd rings and non-planar graphs1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39490741982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39227011981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39429881981-01-01Paper
A characterization of planar cubic graphs1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38661361979-01-01Paper
An additivity theorem for maximum genus of a graph1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41803941978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42002321978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38709221977-01-01Paper
A new characterization of planar graphs1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41418351977-01-01Paper
Erratum: On defect-d matching in graphs1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40872201976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41001081976-01-01Paper
On the Number of Parity Sets in a Graph1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41192261976-01-01Paper
On defect-d matchings in graphs1975-01-01Paper
A characterization of convertible (0,1)-matrices1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40671301975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40973101974-01-01Paper
A theorem on connected graphs in which every edge belongs to a 1-factor1974-01-01Paper
Kasteleyn's Theorem and Arbitrary Graphs1973-01-01Paper
The parity of the number of 1-factors of a graph1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56454461972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q51835281971-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Charles H. C. Little