![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Charles H. C. Little
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j47]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): 1 (2020)
2010 – 2019
- 2016
- [j46]Marcelo Henriques de Carvalho, C. H. C. Little:
A characterization of minimal non-Seymour graphs. Discret. Math. 339(2): 547-559 (2016) - 2014
- [j45]Marcelo Henriques de Carvalho, Charles H. C. Little:
Matching Covered Graphs with Three Removable Classes. Electron. J. Comb. 21(2): 2 (2014) - [j44]Marcelo Henriques de Carvalho, Charles H. C. Little:
The Parity of a Thicket. Electron. J. Comb. 21(2): 2 (2014) - 2013
- [j43]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): 772-783 (2013) - 2010
- [j42]C. H. C. Little, G. Sanjith:
Another Characterisation of Planar Graphs. Electron. J. Comb. 17(1) (2010)
2000 – 2009
- 2009
- [j41]Marcelo Henriques de Carvalho, C. H. C. Little:
Circuit decompositions of join-covered graphs. J. Graph Theory 62(3): 220-233 (2009) - 2008
- [j40]Marcelo Henriques de Carvalho, C. H. C. Little:
Vector Spaces and the Petersen Graph. Electron. J. Comb. 15(1) (2008) - [j39]Marcelo Henriques de Carvalho, C. H. C. Little:
Ear Decompositions in Combed Graphs. Electron. J. Comb. 15(1) (2008) - 2006
- [j38]Charles H. C. Little, Andrew Vince
:
Parity Versions of 2-Connectedness. Electron. J. Comb. 13(1) (2006) - 2005
- [j37]Sven Hartmann, Charles H. C. Little:
Even Bonds of Prescribed Directed Parity. Electron. J. Comb. 12 (2005) - 2004
- [j36]Feng Ming Dong, Michael D. Hendy, Kee L. Teo, Charles H. C. Little:
Graph-functions associated with an edge-property. Australas. J Comb. 30: 3-20 (2004) - [j35]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) - [j34]Serguei Norine, Charles H. C. Little, Kee L. Teo:
A new proof of a characterisation of Pfaffian bipartite graphs. J. Comb. Theory B 91(1): 123-126 (2004) - 2003
- [j33]Ilse Fischer, Charles H. C. Little:
Even Circuits of Prescribed Clockwise Parity. Electron. J. Comb. 10 (2003) - 2002
- [j32]Feng Ming Dong, Kee L. Teo, Charles H. C. Little, Michael D. Hendy:
Two invariants for adjointly equivalent graphs. Australas. J Comb. 25: 133-144 (2002) - [j31]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: 167-174 (2002) - [j30]Charles H. C. Little, Franz Rendl, Ilse Fischer
:
Towards a characterisation of Pfaffian near bipartite graphs. Discret. Math. 244(1-3): 279-297 (2002) - [j29]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): 71-78 (2002) - [j28]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): 303-321 (2002) - 2001
- [j27]Ilse Fischer
, Charles H. C. Little:
A Characterisation of Pfaffian Near Bipartite Graphs. J. Comb. Theory B 82(2): 175-222 (2001) - [j26]Feng Ming Dong
, Khee Meng Koh, Kee L. Teo, C. H. C. Little, Michael D. Hendy:
Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs. J. Graph Theory 37(1): 48-77 (2001) - 2000
- [j25]C. H. C. Little, A. E. Campbell:
Evolutionary Familes of Sets. Electron. J. Comb. 7 (2000) - [j24]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): 73-88 (2000) - [j23]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): 107-124 (2000)
1990 – 1999
- 1999
- [j22]Michael A. Henning, C. H. C. Little:
On the principal edge bipartition of a graph. Australas. J Comb. 20: 91-96 (1999) - 1998
- [j21]Dan Archdeacon, Nora Hartsfield, C. H. C. Little, Bojan Mohar:
Obstruction Sets for Outer-Projective-Planar Graphs. Ars Comb. 49 (1998) - 1997
- [j20]Yee-Hock Peng, C. H. C. Little, Kee L. Teo, Hong Wang:
Chromatic equivalence classes of certain generalized polygon trees. Discret. Math. 172(1-3): 103-114 (1997) - [j19]Charles H. C. Little, Kee L. Teo, Hong Wang:
On a Conjecture on Directed Cycles in a Directed Bipartite Graph. Graphs Comb. 13(3): 267-273 (1997) - 1996
- [j18]Hong Wang, Charles H. C. Little, Kee L. Teo:
Partition of a directed bipartite graph into two directed cycles. Discret. Math. 160(1-3): 283-289 (1996) - [j17]Dan Archdeacon, Nora Hartsfield, C. H. C. Little:
Nonhamiltonian Triangulations with Large Connectivity and Representativity. J. Comb. Theory, Ser. B 68(1): 45-55 (1996) - [c3]Charles H. C. Little, Bruce van Brunt:
A Condition for a Normal Semicycle to Separate an Orientable 3-Graph. DMTCS 1996: 330-337 - 1995
- [j16]Charles H. C. Little, Hong Wang:
Vertex disjoint cycles in a directed graph. Australas. J Comb. 12: 113-120 (1995) - [j15]Dan Archdeacon, C. Paul Bonnington
, Charles H. C. Little:
An algebraic characterization of planar graphs. J. Graph Theory 19(2): 237-250 (1995) - 1994
- [j14]C. Paul Bonnington, Charles H. C. Little:
A combinatorial generalisation of the Jordan curve theorem. Australas. J Comb. 9: 179-200 (1994) - 1992
- [j13]Roger B. Eggleton, Derek A. Holton, Charles H. C. Little:
Cycles and paths in multigraphs. Australas. J Comb. 5: 3-12 (1992) - [j12]C. Paul Bonnington, C. H. C. Little:
The classification of combinatorial surfaces using 3-graphs. Australas. J Comb. 5: 87-102 (1992) - 1991
- [c2]Dan Archdeacon, C. Paul Bonnington, Charles H. C. Little:
Cycles, Cocycles and Diagonals: A Characterization of Planar Graphs. Planar Graphs 1991: 1-3 - [c1]C. Paul Bonnington, Charles H. C. Little:
A Generalisation of MacLane's Theorem to 3-graphs. Planar Graphs 1991: 17-36 - 1990
- [j11]I. Rinsma, C. H. C. Little, Douglas R. Woodall:
Maximal matchings in graphs with large neighborhoods of independent vertices. J. Graph Theory 14(2): 167-171 (1990)
1980 – 1989
- 1989
- [j10]Andrew Vince
, Charles H. C. Little:
Discrete Jordan Curve Theorems. J. Comb. Theory B 47(3): 251-261 (1989) - 1988
- [j9]Charles H. C. Little:
Cubic combinatorial maps. J. Comb. Theory B 44(1): 44-63 (1988) - 1985
- [j8]Charles H. C. Little, Derek A. Holton:
No graph has a maximal 3-ring of bonds. J. Comb. Theory B 38(2): 139-142 (1985) - 1984
- [j7]Mark N. Ellingham, Derek A. Holton, Charles H. C. Little:
Cycles through ten vertices in 3-connected cubic graphs. Comb. 4(4): 265-273 (1984) - 1982
- [j6]Derek A. Holton, Charles H. C. Little:
Regular odd rings and non-planar graphs. Comb. 2(2): 149-152 (1982) - [j5]Lowell W. Beineke, Charles H. C. Little:
Cycles in bipartite tournaments. J. Comb. Theory B 32(2): 140-145 (1982) - 1980
- [j4]Charles H. C. Little:
A characterization of planar cubic graphs. J. Comb. Theory B 29(2): 185-194 (1980)
1970 – 1979
- 1978
- [j3]C. H. C. Little, Richard D. Ringeisen:
An additivity theorem for maximum genus of a graph. Discret. Math. 21(1): 69-74 (1978) - 1975
- [j2]Charles H. C. Little, Douglas D. Grant, Derek A. Holton:
On defect-d matchings in graphs. Discret. Math. 13(1): 41-54 (1975) - 1972
- [j1]Charles H. C. Little:
The parity of the number of 1-factors of a graph. Discret. Math. 2(2): 179-181 (1972)
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint