Terry A. McKee

From MaRDI portal
Person:376560

Available identifiers

zbMath Open mckee.terry-aMaRDI QIDQ376560

List of research outcomes





PublicationDate of PublicationType
Graphs in which every c edges that form a tree are chords of a common cycle2021-09-01Paper
https://portal.mardi4nfdi.de/entity/Q50002912021-07-12Paper
https://portal.mardi4nfdi.de/entity/Q49871712021-04-28Paper
Unique chords of unique cycles in 3-connected planar graphs2021-04-09Paper
Dualizing distance-hereditary graphs2020-12-08Paper
https://portal.mardi4nfdi.de/entity/Q51332672020-11-12Paper
https://portal.mardi4nfdi.de/entity/Q32955002020-07-10Paper
Odd twists on strongly chordal graphs2019-07-12Paper
Strongly unichord-free graphs2019-02-07Paper
https://portal.mardi4nfdi.de/entity/Q53764232018-09-17Paper
Strict chordal digraphs viewed as graphs with distinguished edges2018-09-06Paper
Characterizing k-chordal unichord-free graphs2018-08-03Paper
Requiring adjacent chords in cycles2018-02-23Paper
Requiring that minimal separators induce complete multipartite subgraphs2018-01-10Paper
New graph classes characterized by weak vertex separators and two-pairs2017-10-13Paper
https://portal.mardi4nfdi.de/entity/Q53654212017-10-06Paper
New characterizations of Gallai's \(i\)-triangulated graphs2017-09-18Paper
Characterizing atoms that result from decomposition by clique separators2017-07-17Paper
Double-crossed chords and distance-hereditary graphs2016-09-14Paper
https://portal.mardi4nfdi.de/entity/Q57409342016-07-20Paper
https://portal.mardi4nfdi.de/entity/Q57407752016-07-20Paper
Strengthening strongly chordal graphs2016-04-12Paper
A new characterization of unichord-free graphs2015-11-17Paper
https://portal.mardi4nfdi.de/entity/Q29488112015-10-06Paper
https://portal.mardi4nfdi.de/entity/Q54999212015-08-05Paper
https://portal.mardi4nfdi.de/entity/Q55003032015-08-05Paper
Characterizing graph classes using twin vertices of regular induced subgraphs2015-05-20Paper
Pairs of edges as chords and as cut-edges2014-11-18Paper
Symmetric graph-theoretic roles of two-pairs and chords of cycles2014-09-29Paper
Maxclique and unit disk characterizations of strongly chordal graphs2014-07-28Paper
Graphs that induce only \(k\)-cycles2014-04-07Paper
https://portal.mardi4nfdi.de/entity/Q54010552014-03-12Paper
The \(i\)-chords of cycles and paths2013-12-13Paper
A note on sparseness conditions on chordless vertices of cycles2013-12-02Paper
When all minimal vertex separators induce complete or edgeless subgraphs2013-11-26Paper
Requiring pairwise nonadjacent chords in cycles2013-11-05Paper
Graphs that have clique (partial) 2-trees2013-06-25Paper
https://portal.mardi4nfdi.de/entity/Q49257162013-06-12Paper
https://portal.mardi4nfdi.de/entity/Q48974802012-12-19Paper
Edge cycle extendable graphs2012-11-08Paper
Minimal weak separators of chordal graphs.2012-10-08Paper
Constrained chords in strongly chordal and distance-hereditary graphs2012-07-02Paper
When every k-cycle has at least f(k) chords2011-10-12Paper
Simplicial and nonsimplicial complete subgraphs2011-09-20Paper
https://portal.mardi4nfdi.de/entity/Q30892982011-08-24Paper
Pentangulated graphs2011-07-04Paper
https://portal.mardi4nfdi.de/entity/Q29999952011-05-18Paper
Clique graph representations of ptolemaic graphs2011-05-09Paper
https://portal.mardi4nfdi.de/entity/Q35825322010-09-02Paper
https://portal.mardi4nfdi.de/entity/Q35819002010-09-02Paper
https://portal.mardi4nfdi.de/entity/Q35825162010-09-02Paper
https://portal.mardi4nfdi.de/entity/Q35659472010-06-07Paper
Strongly pancyclic and dual-pancyclic graphs2009-08-03Paper
Parity and disparity subgraphs2009-06-19Paper
Uniquely Hamiltonian characterizations of distance-hereditary and parity graphs2009-04-07Paper
https://portal.mardi4nfdi.de/entity/Q36159712009-03-24Paper
https://portal.mardi4nfdi.de/entity/Q54421752008-02-22Paper
Chordal multipartite graphs and chordal colorings2007-08-23Paper
https://portal.mardi4nfdi.de/entity/Q34295012007-04-02Paper
https://portal.mardi4nfdi.de/entity/Q54883502006-09-14Paper
https://portal.mardi4nfdi.de/entity/Q54883582006-09-14Paper
https://portal.mardi4nfdi.de/entity/Q54773802006-07-03Paper
https://portal.mardi4nfdi.de/entity/Q33783542006-03-30Paper
https://portal.mardi4nfdi.de/entity/Q57085992005-11-18Paper
Requiring chords in cycles2005-09-22Paper
https://portal.mardi4nfdi.de/entity/Q54635182005-08-04Paper
https://portal.mardi4nfdi.de/entity/Q46819852005-06-09Paper
https://portal.mardi4nfdi.de/entity/Q46779302005-05-23Paper
https://portal.mardi4nfdi.de/entity/Q46603242005-03-21Paper
Biclique comparability digraphs of bipartite graphs and minimum ranks of partial matrices2004-11-18Paper
https://portal.mardi4nfdi.de/entity/Q44582182004-03-17Paper
https://portal.mardi4nfdi.de/entity/Q44308472003-10-13Paper
The neighborhood characteristic parameter for graphs2003-09-24Paper
Subgraph trees in graph theory2003-09-04Paper
Restricted circular-arc graphs and clique cycles2003-04-09Paper
Dualizing chordal graphs2003-04-09Paper
Chordal bipartite, strongly chordal, and strongly chordal bipartite graphs2003-03-16Paper
https://portal.mardi4nfdi.de/entity/Q45293062002-09-25Paper
https://portal.mardi4nfdi.de/entity/Q45522152002-08-29Paper
Chordally signed graphs2002-08-29Paper
An inequality characterizing chordal graphs2001-12-17Paper
Induced cycle structure and outerplanarity2001-11-13Paper
Clique representations and dimension-\(k\) chordal graphs2001-07-02Paper
https://portal.mardi4nfdi.de/entity/Q45030972001-01-23Paper
https://portal.mardi4nfdi.de/entity/Q44891532001-01-14Paper
Strong clique trees, neighborhood trees, and strongly chordal graphs2000-11-19Paper
A new characterization of strongly chordal graphs2000-08-15Paper
Transchordal graphs2000-06-21Paper
https://portal.mardi4nfdi.de/entity/Q49378102000-06-09Paper
https://portal.mardi4nfdi.de/entity/Q38397151999-08-19Paper
The leafage of a chordal graph1999-05-09Paper
Topics in Intersection Graph Theory1999-03-15Paper
Chordal graph models of contingency tables1998-09-24Paper
https://portal.mardi4nfdi.de/entity/Q43906361998-09-14Paper
https://portal.mardi4nfdi.de/entity/Q43510731998-02-23Paper
https://portal.mardi4nfdi.de/entity/Q43615651998-02-22Paper
Clique neighborhoods and nearly chordal graphs1998-01-19Paper
https://portal.mardi4nfdi.de/entity/Q43373441997-11-10Paper
https://portal.mardi4nfdi.de/entity/Q52840721997-05-19Paper
Structural conditions for cycle completable graphs1996-12-08Paper
Multigraph representations of hierarchical loglinear models1996-10-17Paper
https://portal.mardi4nfdi.de/entity/Q48737581996-04-22Paper
https://portal.mardi4nfdi.de/entity/Q48710401996-03-28Paper
Niche space, multigraphs, and the Helly condition1995-10-30Paper
\(p\)-competition graphs1995-06-12Paper
Representations of graphs modulo n1995-06-11Paper
https://portal.mardi4nfdi.de/entity/Q43261991995-03-19Paper
https://portal.mardi4nfdi.de/entity/Q43091331995-01-02Paper
On the chordality of a graph1994-12-18Paper
The square of a chordal graph1994-05-05Paper
\(p\)-competition numbers1994-04-13Paper
https://portal.mardi4nfdi.de/entity/Q31392711993-11-11Paper
https://portal.mardi4nfdi.de/entity/Q31397361993-11-11Paper
2-Competition Graphs1993-04-01Paper
https://portal.mardi4nfdi.de/entity/Q39912561992-06-28Paper
Edge-clique graphs1992-06-27Paper
https://portal.mardi4nfdi.de/entity/Q39766321992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39766301992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39805611992-06-26Paper
On distances between isomorphism classes of graphs1992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q47120241992-06-25Paper
Intersection properties of graphs1992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q34721431990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33489461989-01-01Paper
Upper bound multigraphs for posets1989-01-01Paper
Dualizing cubic graph theory1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47298161988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37957081987-01-01Paper
Generalized complementation1987-01-01Paper
Multiterminal duality and three-terminal series-parallelness1987-01-01Paper
Dual properties within graph theory1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37833111987-01-01Paper
Underlying properties of oriented graphs1986-01-01Paper
Generalized equivalence: A pattern of mathematical expression1985-01-01Paper
The Logic of Graph-Theoretic Duality1985-01-01Paper
Logical Aspects of Combinatorial Duality1984-01-01Paper
Recharacterizing Eulerian: Intimations of new duality1984-01-01Paper
Relative expressiveness of the edge/adjacency language for graph theory1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32222291984-01-01Paper
Duality principles for binary matroids and graphs1983-01-01Paper
Validity up to complementation in graph theory1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33096091983-01-01Paper
Series‐parallel graphs: A logical approach1983-01-01Paper
A quantifier for matroid duality1981-01-01Paper
Generalized equivalence and the phraseology of configuration theorems1980-01-01Paper
Generalized equivalence and the foundations of quasigroups1980-01-01Paper
Monadic Characterizations in Nonstandard Topology1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39012971980-01-01Paper
A self-dual language for graph theory1979-01-01Paper
Forbidden subgraphs in terms of forbidden quantifiers1978-01-01Paper
Quantification of Greek Variables in Calculus1977-01-01Paper
Sentences Preserved between Equivalent Topological Bases1976-01-01Paper
Infinitary logic and topological homeomorphisms1975-01-01Paper
Logical and graph-theoretic characterizations of the self-dual sentences of projective geometry1975-01-01Paper
A formal analogy between Baer subplanes and their complements1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40566421975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55514161969-01-01Paper
Sylvester's Problem on Collinear Points1968-01-01Paper

Research outcomes over time

This page was built for person: Terry A. McKee