The following pages link to Charles H. C. Little (Q405202):
Displayed 50 items.
- Matching covered graphs with three removable classes (Q405203) (← links)
- The parity of a thicket (Q405214) (← links)
- Item:Q405202 (redirect page) (← links)
- Discrete Jordan curve theorems (Q580354) (← links)
- A characterization of minimal non-Seymour graphs (Q898107) (← links)
- Vector spaces and the Petersen graph (Q1010714) (← links)
- Ear decompositions in combed graphs (Q1010725) (← links)
- No graph has a maximal 3-ring of bonds (Q1059647) (← links)
- Cubic combinatorial maps (Q1073039) (← links)
- Rings of bonds in graphs (Q1160145) (← links)
- On defect-d matchings in graphs (Q1216323) (← links)
- Erratum: On defect-d matching in graphs (Q1220521) (← links)
- An additivity theorem for maximum genus of a graph (Q1244241) (← links)
- A characterization of planar cubic graphs (Q1247429) (← links)
- Towards a characterisation of Pfaffian near bipartite graphs (Q1349098) (← links)
- Even circuits of prescribed clockwise parity (Q1422132) (← links)
- Chromatically unique multibridge graphs (Q1422157) (← links)
- An attempt to classify bipartite graphs by chromatic polynomials (Q1579550) (← links)
- Chromatically unique bipartite graphs with low 3-independent partition numbers (Q1586760) (← links)
- The vertex-cover polynomial of a graph (Q1613435) (← links)
- A new proof of a characterisation of Pfaffian bipartite graphs (Q1826958) (← links)
- Regular odd rings and non-planar graphs (Q1835679) (← links)
- A characterization of convertible (0,1)-matrices (Q1843571) (← links)
- Chromaticity of some families of dense graphs (Q1850066) (← links)
- A characterisation of Pfaffian near bipartite graphs (Q1850543) (← links)
- Nonhamiltonian triangulations with large connectivity and representativity (Q1924157) (← links)
- A characterization of PM-compact bipartite and near-bipartite graphs (Q1942671) (← links)
- Evolutionary families of sets (Q1967111) (← links)
- Cycles through ten vertices in 3-connected cubic graphs (Q2266024) (← links)
- On essentially 4-edge-connected cubic bricks (Q2290348) (← links)
- Another characterisation of planar graphs (Q2380426) (← links)
- The parity of the number of 1-factors of a graph (Q2550034) (← links)
- Even bonds of prescribed directed parity (Q2583664) (← links)
- (Q2713608) (← links)
- Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs (Q2725050) (← links)
- (Q2778264) (← links)
- (Q3138281) (← links)
- (Q3138284) (← links)
- Comparing Trees with Pendant Vertices Labelled (Q3221788) (← links)
- (Q3322125) (← links)
- (Q3481721) (← links)
- Circuit decompositions of join-covered graphs (Q3652553) (← links)
- (Q3688434) (← links)
- (Q3762352) (← links)
- (Q3823393) (← links)
- (Q3826614) (← links)
- (Q3866136) (← links)
- (Q3870922) (← links)
- (Q3922701) (← links)
- (Q3942988) (← links)