An intermediate value theorem for graphs with given automorphism group. - Pavol Hell; Louis V. Quintas (J. Graph Theory, 1979)

Extremal f-trees and embedding spaces for molecular graphs. - John W. Kennedy; Louis V. Quintas (Discret. Appl. Math., 1983)

Counting and coding identity trees with fixed diameter and bounded degree. - Claude W. Haigh; John W. Kennedy; Louis V. Quintas (Discret. Appl. Math., 1984)

Random subgraphs of the n-cycle. - Zbigniew Palka; Louis V. Quintas (Discret. Math., 1984)

Antigenesis: A cascade-theoretical analysis of the size distributions of antigen - antibody complexes. - Robert Gross; Martin L. Yarmush; John W. Kennedy; Louis V. Quintas (Discret. Appl. Math., 1988)

The sequential generation of random f-graphs. Line maximal 2-, 3- and 4-graphs. - Krystyna T. Balinska; Louis V. Quintas (Comput. Chem., 1990)

The sequential generation of random f-graphs. distributions and predominant types of edge maximal f-graphs with f>;4. - Krystyna T. Balinska; Louis V. Quintas (Discret. Math., 1993)

The largest component in a random subgraph of the n-cycle. - Gyula O. H. Katona; Louis V. Quintas (Discret. Math., 1993)

Random Recursive Forests. - Krystyna T. Balinska; Louis V. Quintas; Jerzy Szymanski (Random Struct. Algorithms, 1994)

A Kinetic Approach to the Random F-graph Process. Paths, Cycles and Components. - Krystyna T. Balinska; Henryk Galina; Louis V. Quintas; Jerzy Szymanski (Discret. Appl. Math., 1996)

Degrees in a digraph whose nodes are graphs. - Krystyna T. Balinska; Louis V. Quintas (Discret. Math., 1996)

A Kinetic Approach to the Random f-Graph Process with Nonuniform Edge Probabilities. - Krystyna T. Balinska; Henryk Galina; Louis V. Quintas; Jerzy Szymanski (J. Chem. Inf. Comput. Sci., 1996)

Results and Problems Concerning Edge Transformed Graphs. - Krystyna T. Balinska; Louis V. Quintas (Electron. Notes Discret. Math., 2000)

Digraphs Whose Nodes are Multigraphs Having Exactly Two Degrees f and 2. - Louis V. Quintas; Jerzy Szymanski (Ars Comb., 2002)

A Vascular Network Growth Estimation Algorithm Using Random Graphs. - Sung-Hyuk Cha; Michael L. Gargano; Louis V. Quintas; Eric M. Wahl (GbRPR, 2005)

Extremal Size In Graphs With Bounded Degree. - Krystyna T. Balinska; Louis V. Quintas; Krzysztof Zwierzynski (Ars Comb., 2006)

Value sets of graphs edge-weighted with elements of a finite abelian group. - Edgar G. DuCasse; Michael L. Gargano; Louis V. Quintas (Discuss. Math. Graph Theory, 2010)

The Maximum Number Of One-Edge Extensions For Graphs With Bounded Degree. - Krystyna T. Balinska; Louis V. Quintas; Krzysztof Zwierzynski (Ars Comb., 2014)