| Josh Abbott*, Phyllis Chinn, Tyler Evans, and Allen Stewart, Variations on Conway's Game of Life |
| Nair Maria Maia de Abreu*, Maria Cristina Rangel, Free poset on permutations by scalar products |
| Tomoko Adachi, Labellings for the complete bipartite graph and Disk Array |
| Julian A. Allagan, Chromatic Polynomial of linear r-uniform unicyclic
hypergraph |
| Angela Angeleska*, Natasa Jonoska, Masahico Saito, Realizable Words for DNA of Ciliates and Assembly Graph Diagrams |
| Ziya Arnavut, Block Minimization Problem |
| E. Arroyo*, F. Arroyo*, J. N. Sun, A Class of General Combinatorial Algebraic Identities and its Applications |
| Chris Augeri*, Barry Mullins, Dursun Bulutoglu, Rusty Baldwin, Leemon Baird, An Algorithm for Determining Isomorphism |
| Jay Bagga*, Adrian Heinz, Mahbubul Majumder, Properties of Graceful Labelings of Cycles |
| Brad Bailey*, John Holliday, Dianna Spence, Outerplanar Edge Bipartitions of Planar Graphs |
| Béla Bajnok, The spanning number and the independence number of a subset of an abelian group |
| Hemant Balakrishnan*, Narsingh Deo, Centrality based community discovery |
| Barry Balof, Vertices and Extreme Rays of the Semiorder Polyhedron |
| Christian Barrientos, Graceful Path-Like Trees |
| Miklos Bartha, Graph reduction in linear time |
| Dinesh G. Sarvate, William Beam*, A New Type of Block Design |
| LeRoy B. Beasley, Perimeter of undirected graphs and their preservers |
| Gordon Beavers*, Wing-Ning Li, All Pairs Optimum Path Algorithms for an Average Path Value |
| Ebrahim Salehi, Patrick Bennett*, On Distance Two Magicness of Graphs |
| David R. Berman*, Douglas D. Smith, Brother Avoiding Round Robin Doubles Tournaments |
| Sergei L. Bezrukov*, Victor P. Piotrowski, Restoration of information in a distributed database |
| B. Bhattacharjya*, A. K. Lal, On the Existence of Constrained Labeling of Locally Finite Graphs |
| Elizabeth J. Billington*, D.G. Hoffman, Path decompositions in complete multipartite graphs |
| Jeffrey Boats*, Lazaros Kikas, John Oleksik, The Nova Graph: An Improvement to the Alternating Group Graph |
| B.B.Bobga*, P.D.Johnson, Completing Partial Latin Squares: Cropper's Problem |
| Jens-P. Bode, Distance graph Ramsey Sets |
| Thomas Böhme*, Jens Schreyer, Learning in Games |
| Peter Boothe*, Zdenek Dvorak, Arthur M. Farley, Andrzej Proskurowski, Graph Covering by Shortest Paths |
| Christina Boucher*, Maja Omanovic, Dave Loker, Graph Isomorphism Completeness for Perfect Graphs and Subclasses of
Perfect Graphs |
| David E. Brown, Interval k-graphs |
| Grady Bullington, The Connell Sum Sequence |
| Mike Burmester, Secure Group Key Exchange, Revisited |
| Cafer Caliskan*, Spyros S. Magliveras, The proper subplanes of VW121 |
| E. Rodney Canfield*,
Brendan McKay, Enumeration Of Integer Matrices w/ Given Row, Column Sums |
| Neil P. Carnes, Necessary Conditions for 1, M, N-Antiautomorphisms of Directed Triple Systems |
| Wai Hong Chan, Bandwidth of Three Dimensional Meshes |
| Phyllis Chinn*, Allen J. Stewart,
Tiling Paths with Primal Graphs |
| D.V. Chopra*,
R.M. Low,
R. Dios, Contributions to Orthogonal Arrays of Strength Six |
| Ping-Tsai Chung*, Sin-Min Lee, On the Super Edge-graceful Spiders of even orders |
| Larry Cummings, On Unbordered Words in the n-Cube |
| Stephen Curran*, Michael Ferencak, Christopher Morgan, John Thompson, Hamiltonicity of the Cartesian Product of Directed Cycles Minus a Rectangular Grid |
| Jennifer R. Daniel, Using Signed Permutations to Represent Weyl Group Elements of a Symmetric Space |
| Sean Daugherty, The Inertia of Unicyclic Graphs |
| Michelle DeDeo, Heisenberg Graphs of Order 6 or more over the Ring of Integers |
| Ermelinda DeLaVina*, Bill Waller, Graffiti.pc on the total domination of a connected graph |
| Renata R. Del-Vecchio*, Cybele T. M. Vinagre, Maria A. A. de Freitas, A note on the Laplacian index of graphs |
| Chandra Dinavahi*, Chris Rodger, Decomposition of a complete graph into paths with no subsystems |
| Dharam Chopra, Rose Dios*, Sin-Min Lee, Tong Siu-Ming, On Super Edge-magic
Deficiencies of Join of Graphs |
| Matthieu Dufour*, Jean Turgeon, Subtraction games {a,b,c} |
| Joanna A. Ellis-Monaghan, A little statistical mechanics for the graph theorist |
| John W. Emert*, Roger B. Nelson, Frank W. Owens*, Multiple Towers of Hanoi with a Path Transition Graph |
| Rosa I. Enciso*, Ronald D. Dutton , Lower Bounds for Global Alliances on Planar Graphs |
| Grady Bullington, Linda Eroh*, John Koker, Hosien Moghadam, Steven J. Winters, Values of γ-labelings of complete bipartite graphs |
| Henry Escuadro*, Futaba Okamoto, Ping Zhang, Vertex-Distinguishing Colorings of Graphs – A Survey |
| |
| Joshua Fallon*, Shanzhen Gao, A Finite Operator Approach to the Tennis Ball Problem |
| A. R. de Lyra, C. A. J. Martinhon,
L. Faria*, On the MAX3SAT Expected Optimum Value |
| Ralph J. Faudree, Connectivity and Cycles in Graphs |
| Ralph J. Faudree, Linear Forests, k-Ordered, and Pancyclic Graphs |
| Norman J. Finizio, Z-cyclic DTWh(p) and OTWh(p) |
| Patrick Fowler*, James Brackett, Conflicting definitions of the energy of a molecular graph |
| Aviezri Fraenkel, The Rat Game and the Mouse Game |
| Aviezri Fraenkel, Sequences, Games and Complexity |
| Dalibor Froncek, Fair Incomplete Tournaments With Odd Number of Teams |
| Shinya Fujita, Recent results on non-separating subgraphs in k-connected graphs |
| Daniel J. Gagliardi*, Michael L. Gargano, Louis V. Quintas, Neighborhood regular graphs |
| Shanzhen Gao*, Zhonghua Tan, Some (0,1)-Matrices Enumerative Problems |
| Edward J. Farrell, Michael L. Gargano*, Louis V. Quintas, Bipartite-Assembly |
| Ralucca Gera*, Steve Horton, Craig Rasmussen, On Dominator Colorings in Graphs |
| Tinaz Ekim, John Gimbel*, Covering Graphs with Cliques and Independent Sets |
| Wayne Goddard, Automated Bounds on Recursive Structures |
| Martin Charles Golumbic*, Marina Lipshteyn, Michal Stern, Edge intersection graphs of single bend paths on a grid |
| Eric Gottlieb, Some elementary results about the walklength of permutations |
| Ralph Grimaldi, Compositions and the Alternate Fibonacci Numbers |
| Vince Grolmusz, Hyperdense Coding with Probabilistic Memory Cells |
| H.-D.O.F. Gronau, On m-simple designs |
| Daniel Gross*, Frank Boesch, L. William Kazmierczak, Charles Suffel, Antonius Suhartomo, Bounds for Component Order Edge Connectivity |
| Ruth Haas*, Aloysius G. Helminck, The combinatorics of a poset of involution |
| Peter Hamburger*, Penny Haxell, Alexandr Kostochka, On Directed Triangles in Digraphs |
| Heiko Harborth, Latin Triangle and Hexagon Boards |
| Jay Bagga, Adrian Heinz*, Mahbubul Majumder*, On Graceful Labelings of Cycles |
| Silvia Heubach*, Sergey Kitaev,Toufik Mansour, Partially Ordered Patterns And Compositions |
| A.J.W. Hilton, Degree bounded factorizations of pseudographs |
| D. G. Hoffman, Super Sudoku Squares |
| E. S. Elliott, S. H. Holliday*, B. C. Wagner, Efficient and Robust Phone Trees |
| S.Baker, R.Flack, S.Houghten*, Optimal Variable-Length Codes of Different Types |
| Wen-Chung Huang*, C. A. Rodger,
A decomposition of (λKv)+ with extended triangles |
| Garth Isaak, A measure of Hamiltonicity |
| Jobby Jacob*, Wayne Goddard, Renu Laskar, Double Vertex Graphs and Complete Double Vertex Graphs |
| Robert Jajcay, Regular Cayley maps from finite abelian groups |
| Alan Jamieson, An Edge-based Variant of the Wimer Method for
Computing the EV-domination Numbers of Trees |
| Lindsay H. Jamieson*, Brian C. Dean, Weighted Alliances in Graphs |
| Jonathan Jedwab, Simplification through Generalisation: Constructing and Enumerating Golay Sequences via Golay Arrays |
| Jonathan Jedwab, Written on a Torus or on a Cylinder? An Elementary Proof of the Barker Array Conjecture |
| Xingde Jia, On a Network Traffic Sensing Problem |
| Okechukwu Chidume, LaShundra Griswold, Peter Johnson*, Self-Referential Derivation |
| Guoli Ding, Jinko Kanno*, Matthias Kriesell, A Generating Theorem for 5-Regular Simple Planar Graphs I |
| Arnfried Kemnitz, [r, s, t]-Chromatic Numbers of Graphs |
| H. Karami, Abdollah Khodkar*, S.M. Sheikholeslami, Trees whose double domination number is twice their domination number |
| Jeffery Boats, Lazaros Kikas*, Mithra Koyyalamudi , John Oleksik, An Algebraic Approach for Finding Disjoint Paths in the Alternating Group Graph and Other Cayley Graphs |
| Russell Kirk*, Hua Wang, The hyper-Wiener index of trees with a given maximum degree |
| Edward C. Carr, Joseph B. Klerlein*, Sufficient Conditions for Hamiltonian Cycles in Cn X Cm –Sk |
| Yusuke Kobayashi, An Extension of the Disjoint Paths Problem |
| Stefan Krause, Measuring Time Using Connected Hourglasses |
| Jaromy Kuhl, A generalization of the Evans Conjecture |
| Harris Kwong*, Sin-Min Lee, On Balance Index Sets of Chain Sum and
Amalgamation of Generalized Theta Graphs |
| Reinhard Laue, t-Wise Balanced Steiner Systems |
| David Leach*, Abdollah Khodkar, The chromatic number of K2(9, 4) |
| Mohammed Ghriga, Christopher League*, On the Construction of Convergent Transfer Subgraphs
in General Labeled Directed Graphs |
| Andrew C. Lee, Revisiting the mastermind game |
| Sin-Min Lee*, Thomas Wang, On The Q(a)-Balance Edge-magic
Graphs |
| Hanno Lefmann, Good Distributions of Points with Large Convex
Hulls of Point Sets |
| Vadim E. Levit*, Eugen Mandrescu, Some Structural Properties of Very Well-Covered Graphs |
| W.C. Shiu, M.L.Tang, M.H.Ling*, Full Friendly Index Set of CmX Cn |
| Drew J. Lipman*, Marc J. Lipman, Complete Bipartite Graphs as Induced Subgraphs of a Influence Digraph of a Time-Stamped Graph |
| Marc J. Lipman, Induced Trees in the Influence Digraph of a Time-Stamped Graph |
| Chunmei Liu*, Louis Shapiro, The Combinatorics of M' = 3M3T |
| Marc Loizeaux*, Lucas van der Merwe, Diameter 3, 4-critical graphs with a diametrical vertex of degree n – 4 |
| Wai-Chee Shiu, Richard M. Low*, Ring-magic labelings of graphs |
| Joan M. Lucas, On Dynamic Optimality in Binary Search Tree Algorithms |
| Michael L. Gargano, Lorraine Lurie*, An evolutionary approach to the min-sum vertex cover problem |
| Wayne Goddard, Jeremy Lyle*, Role Assignments of Trees |
| Soumen Maity*, Rajesh Pratap Singh, Permutation Polynomials Modulo pn |
| Kenneth Matheis*, Shanzhen Gao, Zhonghua Tan, Enumeration Of Nonnegative Integer Matrices |
| Yasuko Matsui, An algorithm for generating all perfect sequences of a chordal
graph |
| L. McCauley*, C. Rodger, Hamilton Decompositions of Multi-Partite Graphs with Specified Leaves |
| Gary Chartrand, Garry L. Johns, Kathleen A. McKeon*, Ping Zhang, Rainbow Connection in Graphs |
| Barry Balof, Jacob Menashe*, Semiorders and Riordan Numbers |
| Marc Loizeaux, Lucas van der Merwe*, 4-Critical Graphs with Diameter 3 |
| Michael Babcock, Larry J. Langley, Sarah K. Merz*, The Distinguishing Number of a Digraph |
| Aaron Meyerowitz, Tutte Polynomials for Grids |
| Bullington, Eroh, McDougal, Moghadam*, Winters, Path and Cycle Decomposition Numbers |
| Robert Molina*, Aklilu Zeleke, On the Convergence of the Maximum Roots of a Fibonacci Type Polynomial Sequence |
| Daisuke Kawasaki, Etsuro Moriya*, Some additional results on the subgraph connecting problem |
| Joy Morris*, Pablo Spiga, Kerri Webb, Some results on Balanced Graphs |
| K. J. Asciak, M. A. Francalanza, J. Lauri, Wendy Myrvold*, Ally and Adversary Reconstruction Numbers |
| Atsuhiro Nakamoto, K6-Minors in triangulations on surfaces |
| Sanjeeb Nanda*, Narsingh Deo, Efficient Techniques for Network Attack Identification and Path Prediction
|
| Darren A. Narayan, Applications of Graph Theory to 3-D Surface Reconstruction,
Telecommunication Networks, and WWW Cybercommunities |
| Seiya Negami, The distinguishing number of triangulations
on the projective plane |
| Yong-Song Ho, Sin-Min Lee, Ho Kuen Ng*, On Balancedness of Some Families of Trees |
| J.D. Key, F. F. Ngwane*, A lower bound for the minimum weight of the dual 7-ary code of a projective plane of order 49 |
| Heinrich Niederhausen*, Shaun Sullivan, Euler coefficients and Dyck paths with a limited sequence of up steps |
| Yoshiaki Oda, Special cases of the Vehicle Routing Problem |
| Futaba Okamoto*, Ping Zhang, On Measures of Traceability in Graphs |
| Katsuhiro Ota, Toughness and bipartite-minors in graphs |
| Kenta Ozeki, A σ4 condition for the cyclability |
| Sibel Ozkan*, Chris A. Rodger, Hamilton decompositions with primitive complements |
| K L Patra, Centroid and Characteristic Set of a Tree |
| Carl S. Pettis,
The ∆- Intersection Problem for Hexagon Triple Systems |
| Val Pinciu, Unfolding Polyhedra into Nets |
| Ke Qiu, On a Combinatorial Problem on the Star Graph |
| W. Lang, J. Quistorff*, E. Schneider, New Results on Integer Programming for Codes |
| Stanisław P. Radziszowski*, Xu Xiaodong, The nonexistence of certain small Folkman graphs |
| Craig Rasmussen, On Computation of Minimum Sum Vertex Covers |
| Timothy A. Redl, University Timetabling via Graph Coloring:
An Alternative Approach |
| George P. Graham, Charles E. Roberts*, Projective Planes and Complete Sets of Orthogonal, Self-orthogonal Latin Squares |
| K.J. Roblee*, T.D. Smotzer, Generalized Family of Extremal Edge-Regular Graphs |
| Miranda Roden*, Peter J.Slater, Liar’s Domination |
| Mariusz Meszka, Alexander Rosa*, Cyclic Kirkman triple systems |
| Robert R. Rubalcaba*, Matt Walsh, Fractional Roman domination |
| George Rudolph, Algorithms for Exploring Generalized PBIBD(2) Combinatorial Designs |
| Chris Deugau, Frank Ruskey*, Brad Jackson, Combinatorial realizations of generalized meta-Fibonacci sequences |
| J. Michewicz, J.T. Saccoman*,
A formula for the number of spanning trees for certain non-threshold split graphs |
| Lifoma Salaam*, Louis Shapiro, Least Common Ancestors and Decomposition Methods in Phylogenetic Trees |
| Ebrahim Salehi, On Zero-Sum Magic Graphs and Their Null Sets |
| Spencer Hurd, Dinesh G. Sarvate*, Using Resolvable BIBDs To Construct GDDs With Two Groups and Block Size k+2 |
| Ingo Schiermeyer, New upper bounds for the chromatic number of a graph |
| Andrew Schneider*, Peter J. Slater, Neighborhood Sums in Graphs |
| Brigitte Servatius, Graphs, frameworks, molecules and mechanisms |
| J. Louis Sewell*, Peter J. Slater, Locating Mobile Instruders Using Dominating Sets |
| Louis Shapiro, The Three Fundamental Equations for Ordered Trees |
| Eddie Cheng, Nart Shawash*, New Decomposition Method for Generalized Star Graphs An,k and Sn,k |
| Wai Chee Shiu, Edge-magic Labeling Matrices of the Composition of Paths with Null Graphs |
| Daluss J. Siewert, Existence of Strict Inequalities Between the Various Matrix Ranks
of Tournament Matrices |
| Rajesh Pratap Singh*, Soumen Maity, A Variant of Arazi's Key Agreement Protocol |
| Anne Sinko*, Peter J. Slater, An Introduction to general R − chromatic Problems |
| Suk Jai Seo, Peter J. Slater*, On coupled and proper-coupled-domination |
| Alexander Soifer, Ramsey Theory Before Ramsey |
| Chris Rodger, Sangeetha Srinivasan*, Disjoint Intersection Problem for Steiner Triple Systems |
| Gary E. Stevens, The Bishop's Tale: A combinatorial Proof of F2n =2 (F2n-1 + F2n-2) - F2n-3 |
| Joshua Abbott, Phyllis Z. Chinn, Tyler Evans, A. J. Stewart*, New Graphs From Star Graphs |
| Frank Boesch, L. William Kazmierczak, Charles Suffel*, Antonius Suhartomo, Daniel Gross, On Component Order Edge Connectivity |
| Blair D. Sullivan, Directed cycles in dense digraphs |
| Heinrich Niederhausen, Shaun Sullivan*, Euler coefficients and Dyck paths with a limited sequence of down steps |
| Ken-ichi Kawarabayashi, Atsuhiro Nakamoto, Yusuke Suzuki*, N-Flips in Even Triangulations on Surfaces |
| Danilo Artigas, Mitre C. Dourado,
Fábio Protti, Jayme L. Szwarcfiter*, The Convex Partition Number of a Graph |
| B. Balamohan, A. Kuznetsov, Stephen Tanny*, On the behaviour of V(n) |
| H. Tapia-Recillas, The Simplex Code over Galois rings |
| Narsingh Deo, Greg Tener*, Attacks on difficult instances of graph isomorphism |
| Vladimir D. Tonchev, Steiner t-wise balanced designs for two-stage disjunctive testing |
| Zengxiang Tong, Connectedness of a Lattice Fuzzy Graph |
| Herwig Unger, Random walks and self-organization in communication networks |
| Chip Vandell, Decycling Revisited |
| Michael L. Gargano, Louis V. Quintas, Gregory A. Vaughn*, Improving a Greedy DNA Motif Search Using a Multiple Genomic Self-Adapting Genetic Algorithm |
| M.
Stiebitz, Zs. Tuza, M.Voigt*, Some remarks on list critical graphs |
| Zs. Tuza, V. Voloshin*, Problems and Results on Colorings of Mixed Hypergraphs |
| Ron Gould, Brian C. Wagner*, Ascending Subgraph Decompositions of Tournaments |
| Matt Walsh, Generalized prisms and fractional domination |
| Sin-Min Lee, Brian Chan, Thomas Wang*, On The Balanced Windmill Graphs |
| John P. Georges, David Mauro, Yan Wang*, On r-paths labeled with a condition at distance two |
| Spyros Magliveras, Wandi Wei*, On the Ancestral Compatibility of Evolutionary Trees |
| David P. Bunde, and Kevin Milans , Douglas B. West*, Hehui Wu, Parity and Strong Parity Edge-Colorings of Graphs |
| John C. Wierman*, Jonathan Smalletz, Cindy Lui, Percolation Threshold Approximations Based on the Second Moment
of the Degree Distribution |
| Linda Eroh, John Koker,
Hosien Moghadam, Steven J. Winters*, Edge-Deleted Eccentricities of Graphs |
| Michael L. Gargano, Henry Wong*, Efficaciously Dismantling Terrorist Networks Subject To Budget Constraints Using Evolutionary Methods |
| Siemion Fajtlowicz, Eunjeong Yi*, Repetitions in coding sequences and Euler’s formula for graphs on surfaces |
| Kiyoshi Yoshimoto, On the number of components in 2-factors of claw-free graphs III |
| Selda Küçükçifçi and Güven Yücetürk*, Maximum packing for perfect four-triple configurations |
| Henry Escuadro, Futaba Okamoto, Ping Zhang*, From Edge Coloring to Vertex Coloring |
