Organizational Unit:
School of Mathematics
Permanent Link
Research Organization Registry ID
Description
Previous Names
Parent Organization
Parent Organization
Includes Organization(s)
ArchiveSpace Name Record
Publication Search Results
Tutte paths and even covers
NON-SEPARATING PATHS IN GRAPHS
Subdivisions of complete graphs
Two graph classes with bounded chromatic number
Matching problems in hypergraphs
6-connected graphs are two-three linked
Counting Hamiltonian cycles in planar triangulations
Erdos-Posa theorems for undirected group-labelled graphs
Coloring graphs with no k5-subdivision: disjoint paths in graphs