According to our database
1,
Terry A. McKee
authored at least 77 papers
between 1975 and 2021.
Collaborative distances:
-
Dijkstra number2 of
four.
-
Erdős number3 of
two.
2021
Dualizing distance-hereditary graphs.
Discuss. Math. Graph Theory, 2021
Graphs that have separator tree representations.
Australas. J Comb., 2021
2020
Unique chords of unique cycles in 3-connected planar graphs.
Discret. Math. Algorithms Appl., 2020
Distance-hereditary and strongly distance-hereditary graphs.
Bull. ICA, 2020
Graphs in which every c edges that form a tree are chords of a common cycle.
AKCE Int. J. Graphs Comb., 2020
2019
Strongly unichord-free graphs.
Discuss. Math. Graph Theory, 2019
Odd twists on strongly chordal graphs.
Discret. Math. Algorithms Appl., 2019
2018
Requiring that minimal separators induce complete multipartite subgraphs.
Discuss. Math. Graph Theory, 2018
Characterizing k-chordal unichord-free graphs.
Discret. Math. Algorithms Appl., 2018
Requiring adjacent chords in cycles.
Discret. Math. Algorithms Appl., 2018
Strict chordal digraphs viewed as graphs with distinguished edges.
Discret. Appl. Math., 2018
A k-partite generalization of chordal bipartite graphs.
Bull. ICA, 2018
2017
Characterizing atoms that result from decomposition by clique separators.
Discuss. Math. Graph Theory, 2017
New characterizations of Gallai's i-triangulated graphs.
Discret. Math., 2017
The Graphs that Dahlhaus called "Good generalized strongly chordal".
Bull. ICA, 2017
New graph classes characterized by weak vertex separators and two-pairs.
AKCE Int. J. Graphs Comb., 2017
2016
Strengthening strongly chordal graphs.
Discret. Math. Algorithms Appl., 2016
Double-crossed chords and distance-hereditary graphs.
Australas. J Comb., 2016
2015
A new characterization of unichord-free graphs.
Discuss. Math. Graph Theory, 2015
2014
Pairs of edges as chords and as cut-edges.
Discuss. Math. Graph Theory, 2014
Maxclique and unit disk characterizations of strongly chordal graphs.
Discuss. Math. Graph Theory, 2014
Symmetric graph-theoretic roles of two-pairs and chords of cycles.
Discret. Math. Algorithms Appl., 2014
2013
When All Minimal Vertex Separators Induce Complete or edgeless subgraphs.
Discret. Math. Algorithms Appl., 2013
A note on sparseness conditions on chordless vertices of cycles.
Discret. Math., 2013
2012
The <i>i</i>-chords of cycles and paths.
Discuss. Math. Graph Theory, 2012
Edge cycle extendable graphs.
Discuss. Math. Graph Theory, 2012
Characterizing graph classes by intersections of neighborhoods.
Contributions Discret. Math., 2012
Graphs with complete minimal k-vertex separators.
Ars Comb., 2012
2011
When every <i>k</i>-cycle has at least <i>f</i>(<i>k</i>) chords.
J. Graph Theory, 2011
Simplicial and nonsimplicial complete subgraphs.
Discuss. Math. Graph Theory, 2011
Minimal weak separators of chordal graphs.
Ars Comb., 2011
2010
Clique graph representations of ptolemaic graphs.
Discuss. Math. Graph Theory, 2010
2009
Strongly pancyclic and dual-pancyclic graphs.
Discuss. Math. Graph Theory, 2009
Parity and disparity subgraphs.
Discret. Math., 2009
2008
Uniquely Hamiltonian Characterizations of Distance-Hereditary and Parity Graphs.
Electron. J. Comb., 2008
2007
Chordal multipartite graphs and chordal colorings.
Discret. Math., 2007
2005
Requiring chords in cycles.
Discret. Math., 2005
2004
Biclique comparability digraphs of bipartite graphs and minimum ranks of partial matrices.
Discret. Math., 2004
Graph Orientations and Signings That Are Saturated with Alternating Cycles.
Ars Comb., 2004
2003
Chordal bipartite, strongly chordal, and strongly chordal bipartite graphs.
Discret. Math., 2003
Restricted circular-arc graphs and clique cycles.
Discret. Math., 2003
Dualizing chordal graphs.
Discret. Math., 2003
Subgraph trees in graph theory.
Discret. Math., 2003
The Neighborhood Characteristic Parameter for Graphs.
Electron. J. Comb., 2003
2002
A Characteristic Approach to Bipartite Graphs and Incidence Graphs.
Electron. Notes Discret. Math., 2002
Discret. Appl. Math., 2002
2000
Strong clique trees, neighborhood trees, and strongly chordal graphs.
J. Graph Theory, 2000
Induced cycle structure and outerplanarity.
Discret. Math., 2000
1999
A new characterization of strongly chordal graphs.
Discret. Math., 1999
An Inequality Characterizing Chordal Graphs.
Ars Comb., 1999
1998
The leafage of a chordal graph.
Discuss. Math. Graph Theory, 1998
1997
Clique neighborhoods and nearly chordal graphs.
Discret. Math., 1997
1996
Structural conditions for cycle completable graphs.
Discret. Math., 1996
1994
Representations of graphs modulo <i>n</i>.
J. Graph Theory, 1994
The square of a chordal graph.
Discret. Math., 1994
1993
On the chordality of a graph.
J. Graph Theory, 1993
<i>p</i>-Competition Numbers.
Discret. Appl. Math., 1993
1992
SIAM J. Discret. Math., 1992
1991
Intersection properties of graphs.
Discret. Math., 1991
1987
Generalized complementation.
J. Comb. Theory B, 1987
Multiterminal duality and three-terminal series-parallelness.
Discret. Appl. Math., 1987
1986
Underlying properties of oriented graphs.
Networks, 1986
1985
Generalized equivalence: A pattern of mathematical expression.
Stud Logica, 1985
1984
Recharacterizing Eulerian: Intimations of new duality.
Discret. Math., 1984
1983
Series-parallel graphs: A logical approach.
J. Graph Theory, 1983
Duality principles for binary matroids and graphs.
Discret. Math., 1983
1981
A quantifier for matroid duality.
Discret. Math., 1981
1980
Generalized equivalence and the phraseology of configuration theorems.
Notre Dame J. Formal Log., 1980
Generalized equivalence and the foundations of quasigroups.
Notre Dame J. Formal Log., 1980
Monadic Characterizations in Nonstandard Topology.
Math. Log. Q., 1980
1979
A self-dual language for graph theory.
J. Comb. Theory B, 1979
1978
Forbidden subgraphs in terms of forbidden quantifiers.
Notre Dame J. Formal Log., 1978
1976
Sentences Preserved between Equivalent Topological Bases.
Math. Log. Q., 1976
1975
Infinitary logic and topological homeomorphisms.
Math. Log. Q., 1975
