default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTerry A. McKee
Person information
- affiliation: Wright State University, Department of Mathematics & Statistics, Dayton, OH, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
Journal Articles
- 2021
[j77]Terry A. McKee:
Graphs that have separator tree representations. Australas. J Comb. 80: 89-98 (2021)- [j76]Terry A. McKee:
Dualizing distance-hereditary graphs. Discuss. Math. Graph Theory 41(1): 285-296 (2021) - 2020
- [j75]Terry A. McKee
:
Graphs in which every c edges that form a tree are chords of a common cycle. AKCE Int. J. Graphs Comb. 17(2): 670-672 (2020) - [j74]Terry A. McKee:
Distance-hereditary and strongly distance-hereditary graphs. Bull. ICA 88: 50-64 (2020) - [j73]Terry A. McKee:
Unique chords of unique cycles in 3-connected planar graphs. Discret. Math. Algorithms Appl. 12(4): 2050056:1-2050056:15 (2020) - 2019
- [j72]Terry A. McKee:
Odd twists on strongly chordal graphs. Discret. Math. Algorithms Appl. 11(3): 1950034:1-1950034:7 (2019) - [j71]Terry A. McKee:
Strongly unichord-free graphs. Discuss. Math. Graph Theory 39(2): 365-374 (2019) - 2018
- [j70]Terry A. McKee:
A k-partite generalization of chordal bipartite graphs. Bull. ICA 83: 77-83 (2018) - [j69]Terry A. McKee:
Strict chordal digraphs viewed as graphs with distinguished edges. Discret. Appl. Math. 247: 122-126 (2018) - [j68]Terry A. McKee:
Requiring adjacent chords in cycles. Discret. Math. Algorithms Appl. 10(1): 1850003:1-1850003:7 (2018) - [j67]Terry A. McKee:
Characterizing k-chordal unichord-free graphs. Discret. Math. Algorithms Appl. 10(4): 1850043:1-1850043:11 (2018) - [j66]Terry A. McKee:
Requiring that minimal separators induce complete multipartite subgraphs. Discuss. Math. Graph Theory 38(1): 263-273 (2018) - 2017
- [j65]Terry A. McKee:
New graph classes characterized by weak vertex separators and two-pairs. AKCE Int. J. Graphs Comb. 14(1): 13-17 (2017) - [j64]Terry A. McKee:
The Graphs that Dahlhaus called "Good generalized strongly chordal". Bull. ICA 80: 93-98 (2017) - [j63]Terry A. McKee:
New characterizations of Gallai's i-triangulated graphs. Discret. Math. 340(12): 2941-2945 (2017) - [j62]Terry A. McKee:
Characterizing atoms that result from decomposition by clique separators. Discuss. Math. Graph Theory 37(3): 587-594 (2017) - 2016
- [j61]Terry A. McKee:
Double-crossed chords and distance-hereditary graphs. Australas. J Comb. 65: 183-190 (2016) - [j60]Terry A. McKee:
Strengthening strongly chordal graphs. Discret. Math. Algorithms Appl. 8(1): 1650002:1-1650002:8 (2016) - 2015
- [j59]Terry A. McKee:
A new characterization of unichord-free graphs. Discuss. Math. Graph Theory 35(4): 765-771 (2015) - 2014
- [j58]Terry A. McKee:
Symmetric graph-theoretic roles of two-pairs and chords of cycles. Discret. Math. Algorithms Appl. 6(3) (2014) - [j57]Pablo De Caria, Terry A. McKee:
Maxclique and unit disk characterizations of strongly chordal graphs. Discuss. Math. Graph Theory 34(3): 593-602 (2014) - [j56]Terry A. McKee:
Pairs of edges as chords and as cut-edges. Discuss. Math. Graph Theory 34(4): 673-681 (2014) - 2013
- [j55]Terry A. McKee:
A note on sparseness conditions on chordless vertices of cycles. Discret. Math. 313(11): 1221-1223 (2013) - [j54]Terry A. McKee:
When All Minimal Vertex Separators Induce Complete or edgeless subgraphs. Discret. Math. Algorithms Appl. 5(3) (2013) - 2012
- [j53]Terry A. McKee:
Graphs with complete minimal k-vertex separators. Ars Comb. 103: 225-232 (2012) - [j52]Terry A. McKee:
Characterizing graph classes by intersections of neighborhoods. Contributions Discret. Math. 7(1) (2012) - [j51]Terry A. McKee:
Edge cycle extendable graphs. Discuss. Math. Graph Theory 32(2): 373-378 (2012) - [j50]Terry A. McKee:
The i-chords of cycles and paths. Discuss. Math. Graph Theory 32(4): 607-615 (2012) - 2011
- [j49]Terry A. McKee:
Minimal weak separators of chordal graphs. Ars Comb. 101: 321-331 (2011) - [j48]Terry A. McKee:
Simplicial and nonsimplicial complete subgraphs. Discuss. Math. Graph Theory 31(3): 577-586 (2011) - [j47]Terry A. McKee:
When every k-cycle has at least f(k) chords. J. Graph Theory 68(2): 137-147 (2011) - 2010
- [j46]Terry A. McKee:
Clique graph representations of ptolemaic graphs. Discuss. Math. Graph Theory 30(4): 651-661 (2010) - 2009
- [j45]Terry A. McKee, Lutz Volkmann:
Parity and disparity subgraphs. Discret. Math. 309(8): 2608-2612 (2009) - [j44]Terry A. McKee:
Strongly pancyclic and dual-pancyclic graphs. Discuss. Math. Graph Theory 29(1): 5-14 (2009) - 2008
- [j43]Terry A. McKee:
Uniquely Hamiltonian Characterizations of Distance-Hereditary and Parity Graphs. Electron. J. Comb. 15(1) (2008) - 2007
- [j42]Terry A. McKee:
Chordal multipartite graphs and chordal colorings. Discret. Math. 307(17-18): 2309-2314 (2007) - 2005
- [j41]Terry A. McKee:
Requiring chords in cycles. Discret. Math. 297(1-3): 182-189 (2005) - 2004
- [j40]Terry A. McKee:
Graph Orientations and Signings That Are Saturated with Alternating Cycles. Ars Comb. 73 (2004) - [j39]Terry A. McKee:
Biclique comparability digraphs of bipartite graphs and minimum ranks of partial matrices. Discret. Math. 287(1-3): 165-170 (2004) - 2003
- [j38]Terry A. McKee:
The Neighborhood Characteristic Parameter for Graphs. Electron. J. Comb. 10 (2003) - [j37]Terry A. McKee:
Chordal bipartite, strongly chordal, and strongly chordal bipartite graphs. Discret. Math. 260(1-3): 231-238 (2003) - [j36]Terry A. McKee:
Dualizing chordal graphs. Discret. Math. 263(1-3): 207-219 (2003) - [j35]Terry A. McKee:
Restricted circular-arc graphs and clique cycles. Discret. Math. 263(1-3): 221-231 (2003) - [j34]Terry A. McKee:
Subgraph trees in graph theory. Discret. Math. 270(1-3): 3-12 (2003) - 2002
- [j33]Terry A. McKee:
Chordally signed graphs. Discret. Appl. Math. 119(3): 273-280 (2002) - [j32]Terry A. McKee:
A Characteristic Approach to Bipartite Graphs and Incidence Graphs. Electron. Notes Discret. Math. 11: 478-484 (2002) - 2000
- [j31]Terry A. McKee:
Dimensions for Cographs. Ars Comb. 56 (2000) - [j30]Terry A. McKee:
Transchordal graphs. Discret. Math. 220(1-3): 171-182 (2000) - [j29]Terry A. McKee:
Induced cycle structure and outerplanarity. Discret. Math. 223(1-3): 387-392 (2000) - [j28]Terry A. McKee:
Strong clique trees, neighborhood trees, and strongly chordal graphs. J. Graph Theory 33(3): 151-160 (2000) - 1999
- [j27]Terry A. McKee:
An Inequality Characterizing Chordal Graphs. Ars Comb. 51 (1999) - [j26]Terry A. McKee:
A new characterization of strongly chordal graphs. Discret. Math. 205(1-3): 245-247 (1999) - 1998
- [j25]In-Jen Lin, Terry A. McKee, Douglas B. West:
The leafage of a chordal graph. Discuss. Math. Graph Theory 18(1): 23-48 (1998) - 1997
- [j24]Terry A. McKee:
Clique neighborhoods and nearly chordal graphs. Discret. Math. 171(1-3): 179-189 (1997) - 1996
- [j23]Charles R. Johnson, Terry A. McKee:
Structural conditions for cycle completable graphs. Discret. Math. 159(1-3): 155-160 (1996) - 1994
- [j22]Frank Harary, Terry A. McKee:
The square of a chordal graph. Discret. Math. 128(1-3): 165-172 (1994) - [j21]Anthony B. Evans, Gerd Fricke, Carl C. Maneri, Terry A. McKee, Manley Perkel:
Representations of graphs modulo n. J. Graph Theory 18(8): 801-815 (1994) - 1993
- [j20]Suh-Ryung Kim, Terry A. McKee, Fred R. McMorris, Fred S. Roberts:
p-Competition Numbers. Discret. Appl. Math. 46(1): 87-92 (1993) - [j19]Terry A. McKee, Edward R. Scheinerman:
On the chordality of a graph. J. Graph Theory 17(2): 221-232 (1993) - 1992
- [j18]Garth Isaak, Suh-Ryung Kim, Terry A. McKee, Fred R. McMorris, Fred S. Roberts:
2-Competition Graphs. SIAM J. Discret. Math. 5(4): 524-538 (1992) - 1991
- [j17]Terry A. McKee:
Intersection properties of graphs. Discret. Math. 89(3): 253-260 (1991) - [j16]Gary Chartrand, S. F. Kapoor, Terry A. McKee, Farrokh Saba:
Edge-clique graphs. Graphs Comb. 7(3): 253-264 (1991) - 1987
- [j15]Terry A. McKee:
Multiterminal duality and three-terminal series-parallelness. Discret. Appl. Math. 18(1): 47-53 (1987) - [j14]Terry A. McKee:
Generalized complementation. J. Comb. Theory B 42(3): 378-383 (1987) - 1986
- [j13]Terry A. McKee:
Underlying properties of oriented graphs. Networks 16(2): 175-180 (1986) - 1985
- [j12]Terry A. McKee:
Generalized equivalence: A pattern of mathematical expression. Stud Logica 44(3): 285-289 (1985) - 1984
- [j11]Terry A. McKee:
Recharacterizing Eulerian: Intimations of new duality. Discret. Math. 51(3): 237-242 (1984) - 1983
- [j10]Terry A. McKee:
Duality principles for binary matroids and graphs. Discret. Math. 43(2-3): 215-222 (1983) - [j9]Terry A. McKee:
Series-parallel graphs: A logical approach. J. Graph Theory 7(2): 177-181 (1983) - 1981
- [j8]Terry A. McKee:
A quantifier for matroid duality. Discret. Math. 34(3): 315-318 (1981) - 1980
- [j7]Terry A. McKee:
Monadic Characterizations in Nonstandard Topology. Math. Log. Q. 26(25-27): 395-397 (1980) - [j6]Terry A. McKee:
Generalized equivalence and the foundations of quasigroups. Notre Dame J. Formal Log. 21(1): 135-140 (1980) - [j5]Terry A. McKee:
Generalized equivalence and the phraseology of configuration theorems. Notre Dame J. Formal Log. 21(1): 141-147 (1980) - 1979
- [j4]Terry A. McKee:
A self-dual language for graph theory. J. Comb. Theory B 27(1): 60-66 (1979) - 1978
- [j3]Terry A. McKee:
Forbidden subgraphs in terms of forbidden quantifiers. Notre Dame J. Formal Log. 19(1): 186-188 (1978) - 1976
- [j2]Terry A. McKee:
Sentences Preserved between Equivalent Topological Bases. Math. Log. Q. 22(1): 79-84 (1976) - 1975
- [j1]Terry A. McKee:
Infinitary logic and topological homeomorphisms. Math. Log. Q. 21(1): 405-408 (1975)
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 2025-12-02 23:50 CET 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
