Miscellaneous
Graph Theory Papers
"When all minimal k-vertex separators induce complete or edgeless subgraphs,"
Journal of Combinatorial Mathematics and Combinatorial Computing, to appear.
"Minimal vertex separators and 3-skein subgraphs,"
Bulletin of the Institute for Combinatorics and its Applications 72 (2014) 19-24.
"Pairs of edges as chords and as cut-edges,"
Discussiones Mathematicae - Graph Theory 34 (2014) 673-681.
"When all minimal vertex separators induce complete or edgeless subgraphs,"
Discrete Mathematics, Algorithms and Applications 5 (2013) 1350015.
"Requiring pairwise nonadjacent chords in cycles,"
Journal of Combinatorics 4 (2013) 357-372.
"Cographs whose complements consist of k-partite components,"
Bulletin of the Institute for Combinatorics and its Applications 67 (2013) 104-110.
"Edge cycle extendable graphs,"
Discussiones Mathematicae - Graph Theory 32 (2012) 373-378.
"A topological metaphor for edge vulnerability,"
Bulletin of the Institute for Combinatorics and its Applications 57 (2009) 8-12.
"Strongly pancyclic and dual-pancyclic graphs,"
Discussiones Mathematicae - Graph Theory 29 (2009) 5-14.
"Parity and disparity graphs" (with L. Volkmann),
Discrete Mathematics 309 (2009) 2608-2612.
"Uniquely hamiltonian characterizations
of distance-hereditary and parity graphs,"
Electronic Journal of Combinatorics 15 (2008) R36.
"Independent separator graphs,"
Utilitas Mathematica 73 (2007) 217-224.
"Chords and connectivity,"
Bulletin of the Institute for Combinatorics and its Applications 47 (2006) 48-52.
"Graph orientations and signings
that are saturated with alternating cycles", Ars
Combinatorica 73 (2004) 107-113.
"An approach to graph-theoretic
homology" (with E. Prisner), in Combinatorics, Graph Theory,
and Algorithms (Y. Alavi, et al., editors), New Issues
Press (Kalamazoo, MI), vol 2, 1999, pp. 631-640.
A primer
for graph theorists of the concepts of Betti number and Euler
characteristic and their connections to several concepts in
chordal graph theory.
"Representations of
graphs modulo n
(with A. Evans, G. Fricke, C. Maneri & M. Perkel), Journal
of Graph Theory 18 (1994) 801-815.
"Highly irregular
multitrees" (with Y. Alavi & D. R. Lick), in Graph Theory,
Combinatorics, Algorithms and Applications (Y. Alavi, et
al., editors), Society for Industrial & Applied Mathematics (Philadelphia)
1991, 342-352.
"Edge-clique graphs"
(with G. Chartrand, S. F. Kapoor & F. Saba), Graphs and
Combinatorics 7 (1991) 253-264.
"On distances between
isomorphism classes of graphs," (with G. Benade, W. Goddard &
P. Winter), Mathematica Bohemica 116
(1991) 160-169.
"A fast method dispatcher
for compiled languages with multiple inheritance" (with R. Dixon,
P. Schweizer, M. Vaughan), ACM SIGPLAN Notices 24/10
(1989) 211-214.
"The mean integrity
of a graph" (with G. Chartrand, S.F. Kapoor, and O. Oellermann),
in Topics in Graph Theory (V. R. Kulli, editor),
Vishwa (Golbarga, India) 1989, 70-80.
|