default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn Engbers
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j20]John Engbers, David J. Galvin, Cliff Smyth:
Reciprocals of thinned exponential series. Australas. J Comb. 89: 61-96 (2024)- 2023
- [j19]John Engbers
, Aysel Erey:
Extremal graphs for average sizes of maximal matchings. Discret. Appl. Math. 341: 308-321 (2023) - 2021
- [j18]John Engbers, Lauren Keough, Taylor Short:
Independent sets in n-vertex k-chromatic ℓ-connected graphs. Discret. Math. 344(7): 112376 (2021) - [j17]John Engbers, Aysel Erey, Jacob Fox, Xiaoyu He:
Tomescu's Graph Coloring Conjecture for ℓ-Connected Graphs. SIAM J. Discret. Math. 35(2): 1478-1502 (2021) - 2020
- [j16]John Engbers, Jay Pantone, Christopher J. Stocker:
Colored multipermutations and a combinatorial generalization of Worpitzky's identity. Australas. J Comb. 78: 335-347 (2020)
2010 – 2019
- 2019
- [j15]John Engbers, Christopher J. Stocker:
Maximizing and minimizing the number of generalized colorings of trees. Discret. Math. 342(4): 1048-1055 (2019) - [j14]John Engbers, David J. Galvin, Cliff Smyth:
Restricted Stirling and Lah number matrices and their inverses. J. Comb. Theory A 161: 271-298 (2019) - 2018
- [j13]John Engbers, Adam Hammett:
On comparability of bigrassmannian permutations. Australas. J Comb. 71: 121-152 (2018) - [j12]John Engbers, Aysel Erey:
Extremal Colorings and Independent Sets. Graphs Comb. 34(6): 1347-1361 (2018) - [j11]John Engbers, Christopher J. Stocker:
Combinatorial Proofs of Identities of Alzer and Prodinger and Some Generalizations. Integers 18: A49 (2018) - 2017
- [j10]John Engbers, David J. Galvin:
Extremal H-colorings of trees and 2-connected graphs. J. Comb. Theory B 122: 800-814 (2017) - [j9]John Engbers:
Maximizing H-Colorings of Connected Graphs with Fixed Minimum Degree. J. Graph Theory 85(4): 780-787 (2017) - 2016
- [j8]John Engbers, Christopher J. Stocker:
Two Combinatorial Proofs of Identities Involving Sums of Powers of Binomial Coefficients. Integers 16: A58 (2016) - 2015
- [j7]John Engbers, Christopher J. Stocker:
Reversible peg solitaire on graphs. Discret. Math. 338(11): 2014-2019 (2015) - [j6]John Engbers, David J. Galvin, Justin Hilyard:
Combinatorially interpreting generalized Stirling numbers. Eur. J. Comb. 43: 32-54 (2015) - [j5]John Engbers:
Extremal H-Colorings of Graphs with Fixed Minimum Degree. J. Graph Theory 79(2): 103-124 (2015) - 2014
- [j4]John Engbers, Adam Hammett:
Trivial Meet and Join within the Lattice of Monotone Triangles. Electron. J. Comb. 21(3): 3 (2014) - [j3]John Engbers, David J. Galvin:
Counting Independent Sets of a Fixed Size in Graphs with a Given Minimum Degree. J. Graph Theory 76(2): 149-168 (2014) - 2013
- [i1]John Engbers, David J. Galvin, Justin Hilyard:
Combinatorially interpreting generalized Stirling numbers. CoRR abs/1308.2666 (2013) - 2012
- [j2]John Engbers, David J. Galvin:
H-colouring bipartite graphs. J. Comb. Theory B 102(3): 726-742 (2012) - [j1]John Engbers, David J. Galvin:
H-coloring tori. J. Comb. Theory B 102(5): 1110-1133 (2012)
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 21:20 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:
