Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaul A. Catlin
Person information
- affiliation: Wayne State University, Department of Mathematics, Detroit, MI, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
[j25]Paul A. Catlin, Hong-Jian Lai, Yehong Shao:
Edge-connectivity and edge-disjoint spanning trees. Discret. Math. 309(5): 1033-1040 (2009)- 2001
- [j24]Paul A. Catlin, Arthur M. Hobbs, Hong-Jian Lai:
Graph family operations. Discret. Math. 230(1-3): 71-97 (2001)
1990 – 1999
- 1996
- [j23]Paul A. Catlin:
The reduction of graph families closed under contraction. Discret. Math. 160(1-3): 67-80 (1996) - [j22]Paul A. Catlin, Zheng-Yiao Han, Hong-Jian Lai:
Graphs without spanning closed trails. Discret. Math. 160(1-3): 81-91 (1996) - [j21]Paul A. Catlin, Hong-Jian Lai:
Supereulerian Graphs and the Petersen Graph. J. Comb. Theory B 66(1): 123-139 (1996) - [j20]Paul A. Catlin:
A reduction criterion for supereulerian graphs. J. Graph Theory 22(2): 151-153 (1996) - 1995
- [j19]Paul A. Catlin, Hong-Jian Lai:
Vertex arboricity and maximum degree. Discret. Math. 141(1-3): 37-46 (1995) - 1992
- [j18]Paul A. Catlin, Jerrold W. Grossman, Arthur M. Hobbs, Hong-Jian Lai:
Fractional Arboricity, Strength, and Principal Partitions in Graphs and Matroids. Discret. Appl. Math. 40(3): 285-302 (1992) - [j17]Paul A. Catlin:
Supereulerian graphs: A survey. J. Graph Theory 16(2): 177-196 (1992) - 1990
- [j16]Paul A. Catlin, Iqbalunnisa T. N. Janakiraman, N. Srinivasan:
Hamilton cycles and closed trails in iterated line graphs. J. Graph Theory 14(3): 347-364 (1990)
1980 – 1989
- 1989
- [j15]Paul A. Catlin:
Spanning eulerian subgraphs and matchings. Discret. Math. 76(2): 95-116 (1989) - [j14]Paul A. Catlin:
Double cycle covers and the petersen graph. J. Graph Theory 13(4): 465-483 (1989) - 1988
- [j13]Paul A. Catlin:
Contractions of graphs with no spanning eulerian subgraphs. Comb. 8(4): 313-321 (1988) - [j12]Paul A. Catlin:
Graph homomorphisms into the five-cycle. J. Comb. Theory B 45(2): 199-211 (1988) - [j11]Paul A. Catlin:
A reduction method to find spanning Eulerian subgraphs. J. Graph Theory 12(1): 29-44 (1988) - 1987
- [j10]Paul A. Catlin:
Spanning trails. J. Graph Theory 11(2): 161-167 (1987) - 1981
- [j9]Béla Bollobás, Paul A. Catlin:
Topological cliques of random graphs. J. Comb. Theory B 30(2): 224-227 (1981) - 1980
- [j8]Béla Bollobás, Paul A. Catlin, Paul Erdös:
Hadwiger's Conjecture is True for Almost Every Graph. Eur. J. Comb. 1(3): 195-199 (1980)
1970 – 1979
- 1979
- [j7]Paul A. Catlin:
Subgraphs with triangular components. Discret. Math. 27(2): 149-170 (1979) - [j6]Paul A. Catlin:
Hajós' graph-coloring conjecture: Variations and counterexamples. J. Comb. Theory B 26(2): 268-274 (1979) - [j5]Paul A. Catlin:
Brooks' graph-coloring theorem and the independence number. J. Comb. Theory B 27(1): 42-48 (1979) - 1978
- [j4]Paul A. Catlin:
A bound on the chromatic number of a graph. Discret. Math. 22(1): 81-83 (1978) - [j3]Paul A. Catlin:
Another bound on the chromatic number of a graph. Discret. Math. 24(1): 1-6 (1978) - [j2]Paul A. Catlin:
Graph Decompositions Satisfying Extremal Degree Constraints. J. Graph Theory 2(2): 165-170 (1978) - 1974
- [j1]Paul A. Catlin:
Subgraphs of graphs, I. Discret. Math. 10(2): 225-233 (1974)
Coauthor Index
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 23:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
