default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn G. Gimbel
Person information
- affiliation: University of Alaska, Fairbanks, AK, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i1]Tínaz Ekim, Burak Nur Erdem, John Gimbel:
Sparse Sets in Triangle-free Graphs. CoRR abs/2406.03290 (2024)- 2022
- [j31]John Gimbel, André Kündgen
, Michael Molloy:
Fractional Cocoloring of Graphs. Graphs Comb. 38(3): 64 (2022) - 2021
- [j30]Yunus Emre Demirci, Tínaz Ekim, John Gimbel, Mehmet Akif Yildiz:
Exact values of defective Ramsey numbers in graph classes. Discret. Optim. 42: 100673 (2021)
2010 – 2019
- 2019
- [j29]Tínaz Ekim, John Gimbel, Oylum Seker:
Small 1-defective Ramsey numbers in perfect graphs. Discret. Optim. 34 (2019) - [j28]John Gimbel, André Kündgen, Binlong Li, Carsten Thomassen:
Fractional Coloring Methods with Applications to Degenerate Graphs and Graphs on Surfaces. SIAM J. Discret. Math. 33(3): 1415-1430 (2019) - 2017
- [j27]Leah Wrenn Berman, Glenn G. Chappell, Jill R. Faudree, John Gimbel, Chris Hartman, Gordon I. Williams:
Graphs with Obstacle Number Greater than One. J. Graph Algorithms Appl. 21(6): 1107-1119 (2017) - [c1]John Gimbel, Patrice Ossona de Mendez, Pavel Valtr:
Obstacle Numbers of Planar Graphs. GD 2017: 67-80 - 2016
- [j26]Leah Wrenn Berman, Glenn G. Chappell, Jill R. Faudree, John G. Gimbel, Chris Hartman:
Uniquely Tree-saturated Graphs. Graphs Comb. 32(2): 463-494 (2016) - 2014
- [j25]Glenn G. Chappell, John G. Gimbel, Chris Hartman:
On cycle packings and feedback vertex sets. Contributions Discret. Math. 9(2) (2014) - 2013
- [j24]Tínaz Ekim, John Gimbel:
Some Defective Parameters in Graphs. Graphs Comb. 29(2): 213-224 (2013) - 2010
- [j23]Louis Esperet, John Gimbel, Andrew D. King:
Covering line graphs with equivalence relations. Discret. Appl. Math. 158(17): 1902-1907 (2010) - [j22]John Gimbel, Jaroslav Nesetril:
Partitions of graphs into cographs. Discret. Math. 310(24): 3437-3445 (2010)
2000 – 2009
- 2009
- [j21]Mitre Costa Dourado, John G. Gimbel, Jan Kratochvíl, Fábio Protti, Jayme Luiz Szwarcfiter:
On the computation of the hull number of a graph. Discret. Math. 309(18): 5668-5674 (2009) - [j20]Tínaz Ekim, John Gimbel:
Partitioning graphs into complete and empty graphs. Discret. Math. 309(19): 5849-5856 (2009) - 2008
- [j19]Glenn G. Chappell, John G. Gimbel, Chris Hartman:
Bounds on the metric and partition dimensions of a graph. Ars Comb. 88 (2008) - 2003
- [j18]John G. Gimbel, Chris Hartman:
Subcolorings and the subchromatic number of a graph. Discret. Math. 272(2-3): 139-154 (2003) - [j17]John Gimbel:
Some Remarks on the Convexity Number of a Graph. Graphs Comb. 19(3): 357-361 (2003) - 2002
- [j16]Celina M. H. de Figueiredo, John G. Gimbel, Célia Picinin de Mello, Jayme Luiz Szwarcfiter:
A note on transitive orientations with maximum sets of sources and sinks. Discret. Appl. Math. 120(1-3): 91-95 (2002) - [j15]John Gimbel, Jaroslav Nesetril:
Partitions of Graphs into Cographs. Electron. Notes Discret. Math. 11: 705-721 (2002) - 2000
- [j14]John Gimbel, Carsten Thomassen:
Coloring triangle-free graphs with fixed size. Discret. Math. 219(1-3): 275-277 (2000)
1990 – 1999
- 1999
- [j13]Celina M. H. de Figueiredo, John G. Gimbel, Célia Picinin de Mello, Jayme Luiz Szwarcfiter:
Even and Odd Pairs in Comparability and in P4-comparability Graphs. Discret. Appl. Math. 91(1-3): 293-297 (1999) - [j12]Celina M. H. de Figueiredo, John G. Gimbel, Célia Picinin de Mello, Jayme Luiz Szwarcfiter:
Linear-time Algorithms for Maximum Sets of Sources and sinks. Electron. Notes Discret. Math. 3: 230-234 (1999) - 1998
- [j11]John G. Gimbel, Ann N. Trenk:
On the Weakness of an Ordered Set. SIAM J. Discret. Math. 11(4): 655-663 (1998) - 1997
- [j10]John G. Gimbel, Michael A. Henning, Zsolt Tuza:
Switching Distance Graphs. Ars Comb. 47 (1997) - [j9]John Gimbel, Maryvonne Mahéo, Christine Virlouvet:
Double total domination of graphs. Discret. Math. 165-166: 343-351 (1997) - 1994
- [j8]John G. Gimbel, Dieter Kratsch, Lorna Stewart:
On Cocolourings and Cochromatic Numbers of Graphs. Discret. Appl. Math. 48(2): 111-127 (1994) - [j7]John G. Gimbel, K. B. Reid:
Independent edges in bipartite graphs obtained from orientations of graphs. J. Graph Theory 18(5): 515-533 (1994) - 1991
- [j6]John Gimbel, Edgar M. Palmer:
Matchings and cycle covers in random digraphs. Discret. Appl. Math. 34(1-3): 121-128 (1991) - [j5]Paul Erdös, John G. Gimbel, Dieter Kratsch:
Some extremal results in cochromatic and dichromatic theory. J. Graph Theory 15(6): 579-585 (1991) - 1990
- [j4]Paul Erdös, John Gimbel, H. Joseph Straight:
Chromatic Number Versus Cochromatic Number in Graphs with Bounded Clique Number. Eur. J. Comb. 11(3): 235-240 (1990)
1980 – 1989
- 1988
- [j3]John Gimbel:
End vertices in interval graphs. Discret. Appl. Math. 21(3): 257-259 (1988) - 1987
- [j2]John Gimbel, H. Joseph Straight:
Some topics in cochromatic theory. Graphs Comb. 3(1): 255-265 (1987) - 1985
- [j1]Dale Skrien, John Gimbel:
Homogeneously representable interval graphs. Discret. Math. 55(2): 213-216 (1985)
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-07-25 19:32 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:
