Paul A. Catlin

From MaRDI portal
Person:175501

Available identifiers

zbMath Open catlin.paul-a.2WikidataQ7148949 ScholiaQ7148949MaRDI QIDQ175501

List of research outcomes

PublicationDate of PublicationType
Edge-connectivity and edge-disjoint spanning trees2009-04-09Paper
https://portal.mardi4nfdi.de/entity/Q27672962002-01-29Paper
Graph family operations2001-10-03Paper
The reduction of graph families closed under contraction1997-07-20Paper
Graphs without spanning closed trails1997-04-07Paper
https://portal.mardi4nfdi.de/entity/Q52840081997-03-09Paper
https://portal.mardi4nfdi.de/entity/Q48881071997-02-17Paper
https://portal.mardi4nfdi.de/entity/Q48711391996-07-28Paper
Supereulerian graphs and the Petersen graph1996-06-18Paper
https://portal.mardi4nfdi.de/entity/Q48738031996-04-21Paper
https://portal.mardi4nfdi.de/entity/Q48736791996-04-17Paper
Vertex arboricity and maximum degree1995-07-24Paper
Fractional arboricity, strength, and principal partitions in graphs and matroids1993-05-16Paper
Supereulerian graphs: A survey1992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q39766041992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39766071992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39746931992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q47111551992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q32010701990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34721381990-01-01Paper
Spanning Eulerian subgraphs and matchings1989-01-01Paper
Double cycle covers and the petersen graph1989-01-01Paper
Graph homomorphisms into the five-cycle1988-01-01Paper
Contractions of graphs with no spanning Eulerian subgraphs1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30322961988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30323021988-01-01Paper
A reduction method to find spanning Eulerian subgraphs1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38081291988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47312111988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37911791987-01-01Paper
Spanning trails1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37416341985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37588511985-01-01Paper
Topological cliques of random graphs1981-01-01Paper
Hadwiger's conjecture is true for almost every graph1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38874911980-01-01Paper
Subgraphs with triangular components1979-01-01Paper
Brooks' graph-coloring theorem and the independence number1979-01-01Paper
Hajos' graph-coloring conjecture: Variations and counterexamples1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39242351979-01-01Paper
A bound on the chromatic number of a graph1978-01-01Paper
Another bound on the chromatic number of a graph1978-01-01Paper
Graph Decompositions Satisfying Extremal Degree Constraints1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41921111978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38725001977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41036151976-01-01Paper
Subgraphs of graphs. I1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40557151974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40557161974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q44052351974-01-01Paper
Concerning the Iterated φ Function1970-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: Paul A. Catlin