Chordal
Graphs Chordal
Graphs | Intersection
multigraphs | Miscellaneous
"Chord-set subgraphs of chordal graphs,"
Utilitas Mathematica, to appear.
"Graphs with complete minimal k-vertex separators,"
Ars Combinatoria, to appear.
"Minimal weak separators of chordal graphs,"
Ars Combinatoria, to appear.
"Chordal multipartite graphs and chordal colorings,"
Discrete Mathematics 307 (2007) 2309-2314.
"Maximal planar (bipartite)
graphs as chordal (bipartite) graphs," Journal of Combinatorial Mathematics
and Combinatorial Computing 51 (2004) 127-135.
"Subgraph trees in
graph theory," Discrete Mathematics
270 (2003) 3-12.
"The depths
of chordal graphs," Congressus
Numerantium 157 (2002) 203-211.
"Clique representations
and dimension-k chordal graphs," Journal of Combinatorial
Mathematics and Combinatorial Computing 36 (2001)
139-148.
"Transchordal graphs,"
Discrete Mathematics 220 (2000)
171-182.
"Strong clique trees,
neighborhood trees, and strongly chordal graphs," Journal
of Graph Theory 33 (2000) 151-160.
"Folded chordal graphs,"
Utilitas Mathematica 56 (1999)
117-125.
"A new characterization
of strongly chordal graphs," Discrete Mathematics
205 (1999) 245-247.
"An inequality characterizing
chordal graphs," Ars Combinatoria 51
(1999) 121-127.
"Leafage of chordal
graphs" (with I.-J. Lin & D.B. West), Discussiones Mathematicae--Graph
Theory 18 (1998) 23-48.
"Clique neighborhoods
and nearly chordal graphs," Discrete Mathematics
171 (1997) 179-189.
"Characteristic
parameters, chordal graphs, and common neighborhoods," Journal
of Combinatorial Mathematics and Combinatorial Computing,
24 (1997) 155-159.
"Beyond chordal
graphs," Journal of Combinatorial Mathematics and Combinatorial
Computing, 23 (1997) 21-31.
"How chordal graphs
work," Bulletin of the Institute of Combinatorics and
its Applications 9 (1993) 27-39.
"On the chordality
of a graph" (with E. R. Scheinerman), Journal of Graph
Theory 17 (1993) 221-232.
Intersection
multigraphs Chordal
graphs | Intersection multigraphs | Miscellaneous
"The square of a
chordal graph" (with F. Harary), Discrete Mathematics
128 (1994) 165-172.
"Clique pseudographs
and pseudo duals," Ars Combinatorica 38
(1994) 161-173.
"Comparability multigraphs"
(with F. R. McMorris), Congressus Numerantium 89
(1992) 33-38.
"Clique multigraphs,"
in Graph Theory, Combinatorics, Algorithms and Applications
(Y. Alavi, et al., editors), Society for Industrial & Applied
Mathematics (Philadelphia) 1991, 371-379.
"Chordal and interval
multigraphs," in Graph Theory Combinatorics and Applications
(Y. Alavi, et al., editors) Wiley Interscience (New York) 1991,
vol 1, 841-848.
"Neighborhood and
self-dual (multi)graphs," Journal of Combinatorial Mathematics
and Combinatorial Computing 8 (1990)
173-180.
"Competition multigraphs
and the multicompetition number," Ars Combinatoria
29B (1990) 185-192.
"Interval competition
multigraphs of food webs," Congressus Numerantium
71 (1990) 197-204.
"Neighborhood and
self-dual (multi)graphs," Journal of Combinatorial Mathematics
and Combinatorial Computing 8 (1990)
173-180.
"Competition multigraphs
and the multicompetition number," Ars Combinatoria
29B (1990) 185-192.
"Interval competition
multigraphs of food webs," Congressus Numerantium
71 (1990) 197-204.
"Niche space, multigraphs,
and the Helly condition," Mathematical and Computer Modelling
22 (1995) 1-8.
These
two papers show how multigraphs might be important to Cohen's
suggested link between foodwebs and interval graphs.
"Upper bound multigraphs
for posets," ORDER 6 (1989) 265-275.
Miscellaneous Chordal
graphs
| Intersection
multigraphs |
Miscellaneous
"Chordless cycles in line graphs,"
Congressus Numerantium, 182 (2007) 29-35.
"Requiring chords in cycles,"
Discrete Mathematics 297 (2005) 182-189.
"A characterisatic
approach to bipartite graphs as incidence graphs," Utilitas
Mathematica 68 (2005) 3-10.
"Chordal bipartite analogs of 2-trees
and isolated failure immune networks," Journal of Combinatorial Mathematics
and Combinatorial Computing 52 (2005) 79-88.
"Clique representations of graphs,"
Congressus Numerantium 170 (2004) 185-192.
"Biclique comparability digraphs of
bipartite graphs and minimum ranks of partial matrices,"
Discrete Mathematics 287 (2004) 165-170.
"Bipartite intersection graphs of the
fundamental cycles and cutsets of a graph," Bulletin of the Institute of
Combinatorics and its Applications 40 (2004) 83-90.
"The neighborhood characteristic
parameter for graphs," Electronic Journal of
Combinatorics 10 (2003) R20.
"Restricted circular-arc graphs
and clique cycles," Discrete
Mathematics 263 (2003) 221-231.
"Chordal bipartite, strongly chordal,
and strongly chordal bipartite graphs," Discrete
Mathematics 260 (2003) 231-238;
erratum 272 (2003) 307
"Chordally
signed graphs," Discrete Applied
Mathematics 119 (2002) 275-282.
"Induced cycle structure
and outerplanarity," Discrete Mathematics
223 (2000) 387-392.
"Dimensions for
cographs," Ars Combinatoria 56
(2000) 89-95.
"Maximal connected
cographs in distance-hereditary graphs," Utilitas Mathematica
57 (2000) 73-80.
"Graph structure
for inclusion-exclusion inequalities," Congressus Numerantium
125 (1997) 5-10.
"Graph structure
for inclusion-exclusion equalities," Congressus Numerantium
133 (1998) 121-126.
"Spanning (2-)trees of intersection graphs and
Hunter-Worsley-type bounds," Utilitas Mathematica
68 (2005) 97-102.
Notice
the difference between the first two titles; all three are related to
what statisticians call "Bonferroni" and "Hunter-Worsley inequalities."
"F-free interval
graphs," Utilitas Mathematica 53
(1998) 147-158.
"Multigraph representations
of hierarchical loglinear models" (with H. J. Khamis), Journal
of Statistical Planning and Inference 53
(1996) 63-74.
"Chordal graph models
of contingency tables (with H. J. Khamis), Mathematics and Computers
with Applications 34 (1997) 89-97.
The
application of chordal graphs to statistics; the second is
written as a primer for graph theorists.
"Subtree catch graphs,"
Congressus Numerantium 90 (1992)
231-238.
"A survey of connection
graphs," in Graph Theory, Combinatorics, and Applications
(Y. Alavi & A. Schwenk, eds) Wiley (1995) vol 2, 767-776.
"Structural characterizations
of cycle completable graphs" (with C.R. Johnson), Discrete
Mathematics 159 (1996) 155-160.
"2-competition graphs"
(with G. Isaak, S. Kim, F. R. McMorris & F. S. Roberts), SIAM
Journal on Discrete Mathematics 5 (1992)
524-538.
"p-competition
numbers" (with S. Kim, F. R. McMorris & F. S. Roberts), Discrete
Applied Mathematics 46 (1993) 87-92.
"p-competition
graphs" (with S. Kim, F. R. McMorris & F. S. Roberts), Linear
Algebra and its Applications 217 (1995)
167-178.
Basic
papers in p-intersection graph theory.
"Intersection properties
of graphs," Discrete Mathematics 89
(1991) 253-260.
"Foundations of
intersection graph theory," Utilitas Mathematica
40 (1991) 77-86.
These
can be looked at as transitional, from "graph metatheory"
to "intersection graph theory."
"Intersection graphs
and cographs," Congressus Numerantium 78
(1990) 223-230.
Chordal
graphs
| Intersection
multigraphs
| Miscellaneous
|
