default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJephian C.-H. Lin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Pavol Hell, Jing Huang
, Jephian C.-H. Lin:
Strong Cocomparability Graphs and Slash-Free Orderings of Matrices. SIAM J. Discret. Math. 38(1): 828-844 (2024)- 2021
- [j11]Pavol Hell, César Hernández-Cruz, Jing Huang, Jephian C.-H. Lin:
Strong Chordality of Graphs with Possible Loops. SIAM J. Discret. Math. 35(1): 362-375 (2021) - 2020
- [j10]Steve Butler, Craig Erickson, Shaun M. Fallat, H. Tracy Hall, Brenda Kroschel, Jephian C.-H. Lin, Bryan L. Shader, Nathan Warnberg, Boting Yang:
Properties of a q-Analogue of Zero Forcing. Graphs Comb. 36(5): 1401-1419 (2020) - [j9]Steve Butler, Craig Erickson, Shaun M. Fallat, H. Tracy Hall, Brenda Kroschel, Jephian C.-H. Lin, Bryan L. Shader, Nathan Warnberg, Boting Yang:
Correction to: Properties of a q-Analogue of Zero Forcing. Graphs Comb. 36(5): 1421-1422 (2020) - [j8]Wayne Barrett, Steve Butler, Shaun M. Fallat, H. Tracy Hall, Leslie Hogben, Jephian C.-H. Lin, Bryan L. Shader, Michael Young:
The inverse eigenvalue problem of a graph: Multiplicities and minors. J. Comb. Theory B 142: 276-306 (2020) - [j7]Pavol Hell, Jing Huang, Jephian C.-H. Lin, Ross M. McConnell:
Bipartite Analogues of Comparability and Cocomparability Graphs. SIAM J. Discret. Math. 34(3): 1969-1983 (2020)
2010 – 2019
- 2019
- [j6]Carlos A. Alfaro, Jephian C.-H. Lin:
Critical ideals, minimum rank and zero forcing number. Appl. Math. Comput. 358: 305-313 (2019) - [j5]Daniela Ferrero, Mary Flagg, H. Tracy Hall, Leslie Hogben, Jephian C.-H. Lin, Seth A. Meyer, Shahla Nasserasr, Bryan L. Shader:
Rigid Linkages and Partial Zero Forcing. Electron. J. Comb. 26(2): 2 (2019) - [i3]Pavol Hell, César Hernández-Cruz, Jing Huang, Jephian C.-H. Lin:
Strongly chordal digraphs and Γ-free matrices. CoRR abs/1909.03597 (2019) - 2018
- [j4]Robin Anderson, Shuliang Bai, Fidel Barrera-Cruz, Éva Czabarka, Giordano Da Lozzo, Natalie L. F. Hobson, Jephian C.-H. Lin, Austin Mohr, Heather C. Smith, László A. Székely, Hays Whitlatch:
Analogies between the Crossing Number and the Tangle Crossing Number. Electron. J. Comb. 25(4): 4 (2018) - [j3]Yen-Jen Cheng, Jephian C.-H. Lin:
Graph Families with Constant Distance Determinant. Electron. J. Comb. 25(4): 4 (2018) - 2017
- [j2]Wayne Barrett, Shaun M. Fallat, H. Tracy Hall, Leslie Hogben, Jephian C.-H. Lin, Bryan L. Shader:
Generalizations of the Strong Arnold Property and the Minimum Number of Distinct Eigenvalues of a Graph. Electron. J. Comb. 24(2): 2 (2017) - [j1]Adam H. Berliner, Chassidy Bozeman, Steve Butler, Minerva Catral, Leslie Hogben, Brenda Kroschel, Jephian C.-H. Lin, Nathan Warnberg, Michael Young:
Zero forcing propagation time on oriented graphs. Discret. Appl. Math. 224: 45-59 (2017) - [i2]Robin Anderson, Shuliang Bai, Fidel Barrera-Cruz, Éva Czabarka, Giordano Da Lozzo, Natalie L. F. Hobson, Jephian C.-H. Lin, Austin Mohr, Heather C. Smith, László A. Székely, Hays Whitlatch:
Analogies between the crossing number and the tangle crossing number. CoRR abs/1709.08119 (2017) - [i1]Franklin H. J. Kenter, Jephian C.-H. Lin:
On the error of a priori sampling: zero forcing sets and propagation time. CoRR abs/1709.08740 (2017)
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:
