| Publication | Date of Publication | Type |
|---|
| Breaking symmetry in complete graphs by orienting edges: asymptotic bounds | 2016-06-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113188 | 2012-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3020033 | 2011-07-29 | Paper |
| On eccentricity sequences of connected graphs | 2011-02-08 | Paper |
| LUNE-FREE KNOT GRAPHS | 2008-08-19 | Paper |
| On the Computational Complexity of the Forcing Chromatic Number | 2008-03-28 | Paper |
| Destroying automorphisms by fixing nodes | 2006-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3378287 | 2006-03-30 | Paper |
| On the codomination number of a graph | 2006-03-23 | Paper |
| Counting circular caterpillars | 2006-03-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3377544 | 2006-03-23 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5708560 | 2005-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2715978 | 2005-07-20 | Paper |
| Identity orientation of complete bipartite graphs | 2005-04-18 | Paper |
| Algorithms for derivation of structurally stable Hamiltonian signed graphs | 2005-02-28 | Paper |
| On the lengths of symmetry breaking-preserving games on graphs | 2004-10-27 | Paper |
| Signed graphs for portfolio analysis in risk management | 2004-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4458844 | 2004-03-15 | Paper |
| Edge Sums Of De Bruijn Interconnection Networks | 2004-02-11 | Paper |
| Methods of destroying the symmetries of a graph | 2003-07-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4329147 | 2003-02-11 | Paper |
| Destroying symmetry by orienting edges: Complete graphs and complete bigraphs | 2002-12-11 | Paper |
| A Radio Coloring of a Hypercube | 2002-12-11 | Paper |
| On the maximum number of cyclic triples in oriented graphs | 2002-12-10 | Paper |
| The Shields-Harary indices of vulnerability of a graph | 2002-11-18 | Paper |
| Identification of the Liaison Persons of an Organization Using the Structure Matrix | 2002-10-22 | Paper |
| Graph Theoretic Methods in the Management Sciences | 2002-10-22 | Paper |
| Connect-It Games | 2002-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4552196 | 2002-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4329129 | 2002-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2765170 | 2002-07-22 | Paper |
| A new graph characteristic and its application to numerical computability | 2002-07-14 | Paper |
| On the geodetic number of a graph | 2002-04-08 | Paper |
| On the out-domination and in-domination numbers of a digraph | 2002-01-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2716519 | 2002-01-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4407715 | 2002-01-01 | Paper |
| An heuristic algorithm for handling multiple responses | 2001-12-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2706953 | 2001-10-03 | Paper |
| Geodetic sets in graphs | 2001-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4520825 | 2001-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4489242 | 2000-12-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4934401 | 2000-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4488555 | 2000-07-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4933934 | 2000-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4953552 | 2000-05-09 | Paper |
| Some small sized spanning subgraphs of a hypercube | 2000-03-05 | Paper |
| Knots and graphs. I: Arc graphs and colorings | 1999-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228228 | 1999-02-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3838230 | 1999-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4211748 | 1998-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4389765 | 1998-11-26 | Paper |
| The irregularity cost of a graph | 1998-11-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4211751 | 1998-10-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4393304 | 1998-06-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4387716 | 1998-05-13 | Paper |
| The color cost of a caterpillar | 1998-05-06 | Paper |
| The e-mail gossip number and the connected domination number | 1998-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4361637 | 1998-03-02 | Paper |
| On complete systems of invariants for small graphs | 1997-08-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2785713 | 1997-07-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4339430 | 1997-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4887819 | 1997-03-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3126448 | 1997-03-31 | Paper |
| Nordhaus-Gaddum inequalities for domination in graphs | 1997-02-17 | Paper |
| Animal-trees and caterpillars are equivalent | 1997-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4887804 | 1997-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4887730 | 1996-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4871165 | 1996-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4873173 | 1996-09-29 | Paper |
| A study of maximum unit-circle caterpillars---tools for the study of the shape of adsorption patterns | 1996-08-04 | Paper |
| ON THE DICHROMATIC INDEX OF A DIGRAPH | 1996-07-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4881931 | 1996-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4876166 | 1996-07-01 | Paper |
| One node fault tolerance for caterpillars and starlike trees | 1996-06-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4880520 | 1996-06-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4862221 | 1996-05-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4863423 | 1996-04-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4873740 | 1996-04-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4873741 | 1996-04-22 | Paper |
| Exact $2$-step domination in graphs | 1996-01-24 | Paper |
| Size in maximal triangle-free graphs and minimal graphs of diameter 2 | 1995-10-03 | Paper |
| On signed degrees in signed graphs | 1995-05-01 | Paper |
| The geodetic number of a graph | 1994-12-21 | Paper |
| Quantifying fault recovery in multiprocessor systems | 1994-12-21 | Paper |
| Variations on a hypercube: Embellishments of parallel architectures | 1994-12-21 | Paper |
| Minimum degree games for graphs | 1994-12-01 | Paper |
| Parallel concepts in graph theory | 1994-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4309151 | 1994-10-12 | Paper |
| The neighborhood inclusion structure of a graph | 1994-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4294594 | 1994-07-13 | Paper |
| Abstract sphere-of-influence graphs | 1994-07-03 | Paper |
| Vulnerability in graphs of diameter four | 1994-06-28 | Paper |
| Spanning subgraphs of a hypercube. IV: Rooted trees | 1994-06-28 | Paper |
| Hypercubes, shuffle-exchange graphs and de Bruijn digraphs | 1994-06-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4294722 | 1994-06-05 | Paper |
| Two graph-colouring games | 1994-05-30 | Paper |
| The square of a chordal graph | 1994-05-05 | Paper |
| Sum graphs over all the integers | 1994-03-10 | Paper |
| Realizing the chromatic numbers of triangulations of surfaces | 1994-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5688089 | 1994-01-01 | Paper |
| Edge fault tolerance in graphs | 1993-09-05 | Paper |
| Independent domination in hypercubes | 1993-08-19 | Paper |
| The irregularity cost or sum of a graph | 1993-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5287864 | 1993-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4692391 | 1993-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4032986 | 1993-05-18 | Paper |
| Subcube fault-tolerance in hypercubes | 1993-05-16 | Paper |
| Changing and unchanging the diameter of a hypercube | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4020459 | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3990579 | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3983101 | 1992-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3983241 | 1992-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3984024 | 1992-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3984223 | 1992-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3984228 | 1992-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3984530 | 1992-06-27 | Paper |
| Spanning subgraphs of a hypercube iii: meshes | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3972133 | 1992-06-25 | Paper |
| What is the difference between the domination and independent domination numbers of a cubic graph? | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5752597 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3032291 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3197846 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3495376 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4729803 | 1989-01-01 | Paper |
| Geodetic contraction games on graphs | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3822185 | 1989-01-01 | Paper |
| On meshy trees | 1989-01-01 | Paper |
| Classification of interpolation theorems for spanning trees and other families of spanning subgraphs | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3483455 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3496360 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4733877 | 1988-01-01 | Paper |
| The number of perfect matchings in a hypercube | 1988-01-01 | Paper |
| Embedding and characterization of quantum chemical reaction graphs on two-dimensional orientable surfaces | 1988-01-01 | Paper |
| On the Euclidean dimension of a wheel | 1988-01-01 | Paper |
| The starlike trees which span a hypercube | 1988-01-01 | Paper |
| Covering and packing in graphs. V. Mispacking subcubes in hypercubes | 1988-01-01 | Paper |
| A survey of the theory of hypercube graphs | 1988-01-01 | Paper |
| Cubical graphs and cubical dimensions | 1988-01-01 | Paper |
| Node-graceful graphs | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3781051 | 1988-01-01 | Paper |
| On graphs with signed inverses | 1988-01-01 | Paper |
| ON THE CLASS-RECONSTRUCTION NUMBER OF TREES | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3822201 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3828017 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3832517 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3033777 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3469126 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4726275 | 1987-01-01 | Paper |
| Hamiltonian threshold graphs | 1987-01-01 | Paper |
| Achievement and avoidance games for generating Abelian groups | 1987-01-01 | Paper |
| The class reconstruction number of maximal planar graphs | 1987-01-01 | Paper |
| A Simple Criterion for a Graph to have a Perfect Matching | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3781799 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3783327 | 1987-01-01 | Paper |
| On Degree Achievement and Avoidance Games for Graphs | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3801594 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3815329 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3027033 | 1987-01-01 | Paper |
| GEODETIC GAMES FOR GRAPHS | 1986-01-01 | Paper |
| A linear algorithm for the cutting center of a tree | 1986-01-01 | Paper |
| Variations on the Ising problem | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3730378 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3734422 | 1986-01-01 | Paper |
| Some genuine graph models in anthropology | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3751397 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3789610 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3791165 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3804746 | 1986-01-01 | Paper |
| Minimal blocking flow in networks | 1986-01-01 | Paper |
| On signed digraphs with all cycles negative | 1985-01-01 | Paper |
| Isomorphic factorizations X: Unsolved problems | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5187309 | 1985-01-01 | Paper |
| On the regulation number of a multigraph | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3705264 | 1985-01-01 | Paper |
| The curl of graphs and networks | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3710545 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3728935 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3739142 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3741646 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3744180 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3751398 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3758849 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3775357 | 1985-01-01 | Paper |
| The graph reconstruction number | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3220612 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3220627 | 1985-01-01 | Paper |
| The Diameter of a Graph and its Complement | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3679237 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3680867 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3689220 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3695295 | 1985-01-01 | Paper |
| Smallest cubic graphs with prescribed properties | 1984-01-01 | Paper |
| Isomorphic factorizations VIII: Bisectable trees | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3715152 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3715154 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3737432 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3767384 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3220633 | 1984-01-01 | Paper |
| The rediscovery of Redfield's papers | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3335814 | 1984-01-01 | Paper |
| Digital metrics: A graph-theoretical approach | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3342617 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3344237 | 1984-01-01 | Paper |
| Regular Digraphs Containing a Given Digraph | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3698679 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3701438 | 1984-01-01 | Paper |
| A tribute to Frank P. Ramsey, 1903–1930 | 1983-01-01 | Paper |
| Domination alteration sets in graphs | 1983-01-01 | Paper |
| The derived signed graph of a digraph | 1983-01-01 | Paper |
| On the structure of a triangle-free infinite-chromatic graph of Gyarfas | 1983-01-01 | Paper |
| A graph and its complement with specified properties. VI: Chromatic and achromatic numbers | 1983-01-01 | Paper |
| Regular graphs containing a given graph | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3712148 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3037473 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3043192 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3222237 | 1983-01-01 | Paper |
| Interpolation theorem for diameters of spanning trees | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3310633 | 1983-01-01 | Paper |
| The degree sets of connected infinite graphs | 1983-01-01 | Paper |
| Regular graphs with given girth pair | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3331250 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3335820 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3344032 | 1983-01-01 | Paper |
| Conditional connectivity | 1983-01-01 | Paper |
| Maximum versus minimum invariants for graphs | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3669440 | 1983-01-01 | Paper |
| In praise of paul erdös on his seventieth | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4740588 | 1982-01-01 | Paper |
| Cluster Inference by Using Transitivity Indices in Empirical Graphs | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4742816 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4750666 | 1982-01-01 | Paper |
| The forcibly-tree and forcibly-unicyclic degree sequences | 1982-01-01 | Paper |
| The smallest 2-connected cubic bipartite planar nonhamiltonian graph | 1982-01-01 | Paper |
| Boolean distance for graphs | 1982-01-01 | Paper |
| Smallest cubic and quartic graphs with a given number of cutpoints and bridges | 1982-01-01 | Paper |
| The smallest cubic multigraphs with prescribed bipartite, block, Hamiltonian and planar properties | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3734445 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3744201 | 1982-01-01 | Paper |
| Homage to roberto frucht | 1982-01-01 | Paper |
| Erratum to "Characterization of (r,s)-Adjacency Graphs of Complexes" | 1982-01-01 | Paper |
| The Trail Number of a Graph | 1982-01-01 | Paper |
| A Point-Symmetric Graph that is Nowhere Reversible | 1982-01-01 | Paper |
| On balance in group graphs | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3312273 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3313891 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3313893 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3663338 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3669448 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3679226 | 1982-01-01 | Paper |
| Oriented two-dimensional circuits | 1981-01-01 | Paper |
| Convexity in graphs | 1981-01-01 | Paper |
| Degree Sequences of Infinite Graphs | 1981-01-01 | Paper |
| The crossing numbers of some generalized Petersen graphs. | 1981-01-01 | Paper |
| Homage to the memory of kazimierz kuratowski | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3910554 | 1981-01-01 | Paper |
| The cohesiveness of a point of a graph | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3921248 | 1981-01-01 | Paper |
| Graphs as models of communication network vulnerability: Connectivity and persistence | 1981-01-01 | Paper |
| Paley graphs satisfy all first-order adjacency axioms | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3929753 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3929761 | 1981-01-01 | Paper |
| Characterization of (r, s)-Adjacency Graphs of Complexes | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3932994 | 1981-01-01 | Paper |
| Counting balanced signed graphs using marked graphs | 1981-01-01 | Paper |
| Generalized Ramsey theory for graphs XII: Bipartite Ramsey sets | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3934436 | 1981-01-01 | Paper |
| Covering and packing in graphs IV: Linear arboricity | 1981-01-01 | Paper |
| A graph and its complement with specified properties. IV. Counting self-complementary blocks | 1981-01-01 | Paper |
| Achievement and avoidance games designed from theorems | 1981-01-01 | Paper |
| Bigraphs versus digraphs via matrices | 1980-01-01 | Paper |
| Digraphs with real and Gaussian spectra | 1980-01-01 | Paper |
| On the color partitions of a graph | 1980-01-01 | Paper |
| The smallest graphs with certain adjacency properties | 1980-01-01 | Paper |
| Which trees are link graphs? | 1980-01-01 | Paper |
| Graph theoretic models | 1980-01-01 | Paper |
| On the spectrum of a complete multipartite graph | 1980-01-01 | Paper |
| A simple algorithm to detect balance in signed graphs | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3852227 | 1980-01-01 | Paper |
| A graph and its complement with specified properties V: The self‐complement index | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3875953 | 1980-01-01 | Paper |
| Graphical Completions of a Sequence | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3880868 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3880877 | 1980-01-01 | Paper |
| Monotone sequences of graphical invariants | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3884149 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3885585 | 1980-01-01 | Paper |
| Some problems in topological graph theory | 1980-01-01 | Paper |
| An Intuitive Approach to Interval Numbers of Graphs | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3897066 | 1980-01-01 | Paper |
| Residually-Complete Graphs | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3907606 | 1980-01-01 | Paper |
| Labeled Bipartite Blocks | 1979-01-01 | Paper |
| Isomorphic factorisations V: Directed graphs | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4192110 | 1979-01-01 | Paper |
| Matrix measures for transitivity and balance* | 1979-01-01 | Paper |
| The spectral approach to determining the number of walks in a graph | 1979-01-01 | Paper |
| The smallest regular graphs with irregular square | 1979-01-01 | Paper |
| Generalized Ramsey theory for graphs, X: Double stars | 1979-01-01 | Paper |
| A graph and its complement with specified properties. III: Girth and circumference | 1979-01-01 | Paper |
| Generalized Ramsey theory. IX: Isomorphic factorizations. IV: Isomorphic Ramsey numbers | 1979-01-01 | Paper |
| A graph and its complement with specified properties. I: Connectivity | 1979-01-01 | Paper |
| The graphs with only self-dual signings | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3864556 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3882489 | 1979-01-01 | Paper |
| The graphs for which all strong orientations are hamiltonian | 1979-01-01 | Paper |
| The probability that a point of a tree is fixed | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3895502 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3916586 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3924229 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3941439 | 1979-01-01 | Paper |
| The structure of threshold graphs | 1979-01-01 | Paper |
| On double and multiple interval graphs | 1979-01-01 | Paper |
| Properties of almost all graphs and complexes | 1979-01-01 | Paper |
| The bichromaticity of a tree | 1978-01-01 | Paper |
| Unicyclic realizability of a degree list | 1978-01-01 | Paper |
| Isomorphic Factorisations. I: Complete Graphs | 1978-01-01 | Paper |
| Generalized ramsey theory for graphs VII: Ramsey numbers for multigraphs and networks | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4186335 | 1978-01-01 | Paper |
| Extremal graphs with given connectivities | 1978-01-01 | Paper |
| Cutpoints in the conjunction of two graphs | 1978-01-01 | Paper |
| Consistency in marked digraphs | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3852224 | 1978-01-01 | Paper |
| Consistent graphs with signed points | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3050455 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4141275 | 1977-01-01 | Paper |
| A graph theoretic approach to the investigation of system‐environment relationships† | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4145732 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4146752 | 1977-01-01 | Paper |
| Line minimal Boolean forests | 1977-01-01 | Paper |
| The biparticity of a graph | 1977-01-01 | Paper |
| Homage to george pólya | 1977-01-01 | Paper |
| The divisibility theorem for isomorphic factorizations of complete graphs | 1977-01-01 | Paper |
| Enumeration of graphs with signed points and lines | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4175315 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4184860 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4190653 | 1977-01-01 | Paper |
| On The tantalizer and Instant insanity | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3050458 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3205260 | 1977-01-01 | Paper |
| Anticritical graphs | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4083703 | 1976-01-01 | Paper |
| Which Nonnegative Matrices Are Self-Inverse? | 1976-01-01 | Paper |
| The adjacency graphs of a complex | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4093480 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4111615 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4111951 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4119237 | 1976-01-01 | Paper |
| On the planarity of 2-complexes | 1976-01-01 | Paper |
| Line removal algorithms for graphs and their degree lists | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4186365 | 1976-01-01 | Paper |
| On tactical configurations with no four-cycles | 1976-01-01 | Paper |
| Corrections : Generalized Ramsey Theory for Graphs V | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4068741 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4075500 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4081275 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4082604 | 1975-01-01 | Paper |
| Point Arboricity Critical Graphs Exist | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4094898 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4121921 | 1975-01-01 | Paper |
| On the cell-growth problem for arbitrary polygons | 1975-01-01 | Paper |
| Self-Complementary Generalized Orbits of a Permutation Group | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4044590 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4044591 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4044601 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4044611 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4044629 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4060995 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4063490 | 1974-01-01 | Paper |
| On clique-extremal (p,q)-graphs | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4770974 | 1974-01-01 | Paper |
| Generalized Ramsey theory for graphs IV, the Ramsey multiplicity of a graph | 1974-01-01 | Paper |
| Generalized Ramsey Theory for Graphs V. the Ramsey Number of a Digraph | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4777311 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4777314 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4777315 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4777324 | 1974-01-01 | Paper |
| The communication problem on graphs | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5672480 | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5672667 | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5672921 | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5682013 | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4083709 | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4770978 | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5183516 | 1973-01-01 | Paper |
| Generalized Ramsey theory for graphs. I: Diagonal numbers | 1973-01-01 | Paper |
| The number of caterpillars | 1973-01-01 | Paper |
| On the number of unique subgraphs | 1973-01-01 | Paper |
| A Maximal Toroidal Graph which is not a Triangulation. | 1973-01-01 | Paper |
| Generalized Ramsey Theory for Graphs. II. Small Diagonal Numbers | 1972-01-01 | Paper |
| Correction: “The smallest graph whose group is cyclic” | 1972-01-01 | Paper |
| Generalized Ramsey theory for graphs | 1972-01-01 | Paper |
| The Two-Triangle Case of the Acquaintance Graph | 1972-01-01 | Paper |
| Graphs Suppressible to an Edge | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5652692 | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5655550 | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5659565 | 1972-01-01 | Paper |
| On the Tree Graph of a Matroid | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5670652 | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5677508 | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5682010 | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4404937 | 1972-01-01 | Paper |
| Generalized Ramsey theory for graphs. III: Small off-diagonal numbers | 1972-01-01 | Paper |
| On the automorphism group of a matroid | 1972-01-01 | Paper |
| Trees with Hamiltonian square | 1971-01-01 | Paper |
| A Graphical Exposition of the Ising Problem | 1971-01-01 | Paper |
| Cospectral Graphs and Digraphs | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5632591 | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5611646 | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5616727 | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5617644 | 1971-01-01 | Paper |
| The cutting center theorem for trees | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5629667 | 1970-01-01 | Paper |
| COVERING AND PACKING IN GRAPHS, I. | 1970-01-01 | Paper |
| A Matrix Approach to Nonstationary Chains | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5661519 | 1970-01-01 | Paper |
| Cubic identity graphs and planar graphs derived from trees | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5663893 | 1970-01-01 | Paper |
| Enumeration under group action: Unsolved graphical enumeration problems, IV | 1970-01-01 | Paper |
| A formal system for information retrieval from files | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5590661 | 1970-01-01 | Paper |
| The achromatic number of a graph | 1970-01-01 | Paper |
| The enumeration of tree-like polyhexes | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5610936 | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5617570 | 1970-01-01 | Paper |
| On the corona of two graphs | 1970-01-01 | Paper |
| Determinants, Permanents and Bipartite Graphs | 1969-01-01 | Paper |
| Labeled trees with unlabeled end-points | 1969-01-01 | Paper |
| Uniquely colorable graphs | 1969-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5572939 | 1969-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5575350 | 1969-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5592128 | 1969-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5592129 | 1969-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5592930 | 1969-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5605167 | 1969-01-01 | Paper |
| On acyclic simplicial complexes | 1968-01-01 | Paper |
| On the point-group and line-group of a graph | 1968-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5560177 | 1968-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5566318 | 1968-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5570129 | 1968-01-01 | Paper |
| Arrow Diagrams are Line Digraphs | 1968-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5580168 | 1968-01-01 | Paper |
| On the coloring of signed graphs | 1968-01-01 | Paper |
| Graphs and Matrices | 1967-01-01 | Paper |
| Boolean Operations on Graphs. | 1967-01-01 | Paper |
| On the Core of a Graph† | 1967-01-01 | Paper |
| The connectivity function of a graph | 1967-01-01 | Paper |
| A criterion for planarity of the square of a graph | 1967-01-01 | Paper |
| Which Graphs have only Self-Converse Orientations? | 1967-01-01 | Paper |
| On the Möbius Ladders | 1967-01-01 | Paper |
| On the number of balanced signed graphs | 1967-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5545841 | 1967-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5548201 | 1967-01-01 | Paper |
| On Indecomposable Graphs | 1967-01-01 | Paper |
| Enumeration of finite automata | 1967-01-01 | Paper |
| The Enumeration Methods of Redfield | 1967-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5578801 | 1967-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5604414 | 1967-01-01 | Paper |
| On the problem of reconstructing a tournament from subtournaments | 1967-01-01 | Paper |
| On the critical lines of a graph | 1967-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5508787 | 1966-01-01 | Paper |
| The smallest graph whose group is cyclic | 1966-01-01 | Paper |
| Connectedness of Products of Two Directed Graphs | 1966-01-01 | Paper |
| The Reconstruction of a Tree from its Maximal Subtrees | 1966-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5516079 | 1966-01-01 | Paper |
| The theory of tournaments: A miniature mathematical system | 1966-01-01 | Paper |
| The Theory of Round Robin Tournaments | 1966-01-01 | Paper |
| The power group enumeration theorem | 1966-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5521493 | 1966-01-01 | Paper |
| On the order of the group of a planar map | 1966-01-01 | Paper |
| Enumeration of Mixed Graphs | 1966-01-01 | Paper |
| Enumeration of Locally Restricted Digraphs | 1966-01-01 | Paper |
| Enumeration of self‐converse digraphs | 1966-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5555548 | 1966-01-01 | Paper |
| On the point-core of a graph | 1966-01-01 | Paper |
| Local Restrictions for Various Classes of Directed Graphs | 1965-01-01 | Paper |
| The Genus of the n-Cube | 1965-01-01 | Paper |
| A dual form of Kuratowski’s theorem | 1965-01-01 | Paper |
| The Maximum Number of Strongly Connected Subtournaments* | 1965-01-01 | Paper |
| A Dual form of Kuratowski's Theorem | 1965-01-01 | Paper |
| Inequalities involving the genus of a graph and its thicknesses | 1965-01-01 | Paper |
| The Thickness of the Complete Graph | 1965-01-01 | Paper |
| On Eulerian and Hamiltonian Graphs and Line Graphs | 1965-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5510190 | 1965-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5515142 | 1965-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5516078 | 1965-01-01 | Paper |
| THE POWER GROUP OF TWO PERMUTATION GROUPS | 1965-01-01 | Paper |
| On the dimension of a graph | 1965-01-01 | Paper |
| On the genus of an n-connected graph | 1964-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5732335 | 1964-01-01 | Paper |
| On the thickness of the complete graph | 1964-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5333061 | 1964-01-01 | Paper |
| Recent results in topological graph theory | 1964-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5541107 | 1964-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5544087 | 1964-01-01 | Paper |
| The number of plane trees with a given partition | 1964-01-01 | Paper |
| A graph theoretic approach to similarity relations | 1964-01-01 | Paper |
| On the embedding of complete graphs in orientable surfaces | 1963-01-01 | Paper |
| On the Number of Crossings in a Complete Graph | 1963-01-01 | Paper |
| Enumeration of Bicolourable Graphs | 1963-01-01 | Paper |
| A Characterization of Block-Graphs | 1963-01-01 | Paper |
| The Dynamics of Brand Loyalty: A Markovian Approach | 1962-01-01 | Paper |
| A Complementary Problem on Nonplanar Graphs | 1962-01-01 | Paper |
| Every planar graph with nine points has a nonplanar complement | 1962-01-01 | Paper |
| THE MAXIMUM CONNECTIVITY OF A GRAPH | 1962-01-01 | Paper |
| Remark on the Preceding Note | 1962-01-01 | Paper |
| Additivity of the genus of a graph | 1962-01-01 | Paper |
| A graph theoretic approach to matrix inversion by partitioning | 1962-01-01 | Paper |
| The Determinant of the Adjacency Matrix of a Graph | 1962-01-01 | Paper |
| Permutations with Restricted Position | 1962-01-01 | Paper |
| A Very Independent Axiom System | 1961-01-01 | Paper |
| A Parity Relation Partitions Its Field Distinctly | 1961-01-01 | Paper |
| The Number of Lines in a Digraph of Each Connectedness Category | 1961-01-01 | Paper |
| Some properties of line digraphs | 1960-01-01 | Paper |
| Some Historical and Intuitive Aspects of Graph Theory | 1960-01-01 | Paper |
| Dissimilarity Characteristic Theorems for Graphs | 1960-01-01 | Paper |
| A matrix criterion for structural balance | 1960-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3272972 | 1960-01-01 | Paper |
| On the Consistency of Precedence Matrices | 1960-01-01 | Paper |
| A Note on Evaluating Determinants | 1960-01-01 | Paper |
| On The Line‐Group of Two‐Terminal Series‐Parallel Networks | 1959-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5548205 | 1959-01-01 | Paper |
| The number of homeomorphically irreducible trees, and other species | 1959-01-01 | Paper |
| On the group of the composition of two graphs | 1959-01-01 | Paper |
| The number of functional digraphs | 1959-01-01 | Paper |
| A Graph Theoretic Method for the Complete Reduction of a Matrix with a View Toward Finding its Eigenvalues | 1959-01-01 | Paper |
| An Elementary Theorem on Graphs | 1959-01-01 | Paper |
| Exponentiation of Permutation Groups | 1959-01-01 | Paper |
| The number of oriented graphs | 1958-01-01 | Paper |
| On the number of bi-colored graphs | 1958-01-01 | Paper |
| On the Number of Dissimilar Graphs Between a Given Graph-Subgraph Pair | 1958-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3252407 | 1958-01-01 | Paper |
| On the Group of a Graph with Respect To a Subgraph | 1958-01-01 | Paper |
| The number of dissimilar supergraphs of a linear graph | 1957-01-01 | Paper |
| On local balance and \(n\)-balance in signed graphs | 1956-01-01 | Paper |
| On the number of dissimilar line-subgraphs of a given graph | 1956-01-01 | Paper |
| Note on the Polya and Otter formulas for enumerating trees | 1956-01-01 | Paper |
| Note on an enumeration theorem of Davis and Slepian | 1956-01-01 | Paper |
| The Number of Linear, Directed, Rooted, and Connected Graphs | 1955-01-01 | Paper |
| The Dissimilarity Characteristic of Linear Graphs | 1954-01-01 | Paper |
| On the notion of balance of a signed graph | 1954-01-01 | Paper |
| A Characterization of Implicative Boolean Rings | 1953-01-01 | Paper |
| On the Number of Husimi Trees | 1953-01-01 | Paper |
| The Extension of an Arbitrary Boolean Algebra to an Implicative Boolean Algebra | 1953-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5823574 | 1953-01-01 | Paper |
| The dissimilarity characteristic of Husimi trees | 1953-01-01 | Paper |
| On the determination of redundancies in sociometric chains | 1952-01-01 | Paper |
| On complete atomic proper relation algebras | 1950-01-01 | Paper |
| Atomic boolean-like rings with finite radical | 1950-01-01 | Paper |
| On the Algebraic Structure of Knots | 1949-01-01 | Paper |
