Graph Meta-Theory Papers
"How vertex elimination can overachieve,"
Journal of Combinatorial Mathematics and Combinatorial Computing,
76 (2011) 201-211.
"Why graph-theoretic conditional semivalidities
tend to be self-complementary,"
Bulletin of the Institute of Combinatorics and its Applications,
61 (2011) 109-112.
"Hereditarily equivalent properties
of graph theory," Congressus Numerantium, 198
(2009) 87-93.
"Bipartite analogs of
graph properties," Congressus Numerantium 60
(1987) 261-268.
"Multiterminal duality
and three-terminal series-parallelness," Discrete Applied
Mathematics 18 (1987) 47-53.
"Generalized complementation,"
Journal of Combinatorial Theory (B) 42
(1987) 378-383.
"Underlying properties
of oriented graphs," Networks 16
(1986) 175-180.
"Relative expressiveness
of the edge/adjacency language for graph theory," Fundamenta
Mathematicae 123 (1984) 163-167.
How pointless is
graph theory? I.e., which notions are expressible in terms of
edges, without mentioning vertices?
"Validity up to complementation
in graph theory," Fundamenta Mathematicae 116
(1983) 93-98.
A graph-theoretic
property is "semivalid" if, for each graph, it holds in either
the graph or the graph's complement (e.g., being connected).
"Forbidden subgraphs
in terms of forbidden quantifiers," Notre Dame Journal of
Formal Logic 19 (1978) 186-188.
Those properties
having forbidden subgraph characterizations--whether induced
subgraphs or not--have a nice characterization in terms of how
quantifiers are used in their definition.
|
