|
|
Journals in DBLP
Ars Comb.
1997, volume: 46, number:
- Lowell W. Beineke, Wayne Goddard, Marc J. Lipman
Graphs with Maximum Edge-Integrity. [Citation Graph (0, 0)][DBLP]
Ars Comb., 1997, v:46, n:, pp:- [Journal]
- Manoel Lemos
Non-binary matroids having four non-binary elements. [Citation Graph (0, 0)][DBLP]
Ars Comb., 1997, v:46, n:, pp:- [Journal]
- Thomas Niessen
A Fan-Type Result for Regular Factors. [Citation Graph (0, 0)][DBLP]
Ars Comb., 1997, v:46, n:, pp:- [Journal]
- Mark Ramras
Fundamental Subsets of Edges of Hypercubes. [Citation Graph (0, 0)][DBLP]
Ars Comb., 1997, v:46, n:, pp:- [Journal]
- Bert Randerath, Lutz Volkmann
Simplicial Graphs and Relationships to Different Graph Invariants. [Citation Graph (0, 0)][DBLP]
Ars Comb., 1997, v:46, n:, pp:- [Journal]
- Marialuisa J. de Resmini
On the classical semitranslation plane of order 16. [Citation Graph (0, 0)][DBLP]
Ars Comb., 1997, v:46, n:, pp:- [Journal]
- Ralph Gordon Stanton
Ryser Designs. [Citation Graph (0, 0)][DBLP]
Ars Comb., 1997, v:46, n:, pp:- [Journal]
- R. P. Swaminathan
On a Class of Graphic Matrices. [Citation Graph (0, 0)][DBLP]
Ars Comb., 1997, v:46, n:, pp:- [Journal]
- Ulrich Teschner
On the bondage number of block graphs. [Citation Graph (0, 0)][DBLP]
Ars Comb., 1997, v:46, n:, pp:- [Journal]
- Timothy R. Walsh
Worst-Case Analysis of Read's Chromatic Polynomial Algorithm. [Citation Graph (0, 0)][DBLP]
Ars Comb., 1997, v:46, n:, pp:- [Journal]
- R. Yilmaz, Ibrahim Cahit
E-cordial Graphs. [Citation Graph (0, 0)][DBLP]
Ars Comb., 1997, v:46, n:, pp:- [Journal]
- Josef Lauri
Pseudosimilarity in Graphs - A Survey. [Citation Graph (0, 0)][DBLP]
Ars Comb., 1997, v:46, n:, pp:- [Journal]
- Peter Horák, Nicholas C. K. Phillips, Walter D. Wallis, Joseph L. Yucas
Counting frequencies of configurations in Steiner Triple Systems. [Citation Graph (0, 0)][DBLP]
Ars Comb., 1997, v:46, n:, pp:- [Journal]
- Alfred Geroldinger, Rudolf Schneider
On Minimal Zero Sequences With Large Cross Number. [Citation Graph (0, 0)][DBLP]
Ars Comb., 1997, v:46, n:, pp:- [Journal]
- Michael O. Albertson
The Irregularity of a Graph. [Citation Graph (0, 0)][DBLP]
Ars Comb., 1997, v:46, n:, pp:- [Journal]
- Kiyoshi Ando, Hideo Komuro
The seven graphs whose H-transformations are uniquely determined. [Citation Graph (0, 0)][DBLP]
Ars Comb., 1997, v:46, n:, pp:- [Journal]
- R. Bodendiek, G. Walther
(a, d)-Antimagic Parachutes II. [Citation Graph (0, 0)][DBLP]
Ars Comb., 1997, v:46, n:, pp:- [Journal]
- A. Antonysamy, G. Arumugam, C. Xavier
An Algorithm To Find The Core Of A CV-Graph. [Citation Graph (0, 0)][DBLP]
Ars Comb., 1997, v:46, n:, pp:- [Journal]
- Gary Chartrand, Grzegorz Kubicki, Christina M. Mynhardt, Farrokh Saba
On Graphs With a Unique Least Common Multiple. [Citation Graph (0, 0)][DBLP]
Ars Comb., 1997, v:46, n:, pp:- [Journal]
- Dragos Cvetkovic
A graph theoretical procedure for clustering binary vectors. [Citation Graph (0, 0)][DBLP]
Ars Comb., 1997, v:46, n:, pp:- [Journal]
- Peter Danziger
Uniform Restricted Resolvable Designs with r = 3. [Citation Graph (0, 0)][DBLP]
Ars Comb., 1997, v:46, n:, pp:- [Journal]
- Guantao Chen, Yiping Liu
Hamiltonian Graphs with Large Neighborhood Unions. [Citation Graph (0, 0)][DBLP]
Ars Comb., 1997, v:46, n:, pp:- [Journal]
- Lane H. Clark, Thomas Dale Porter
On the Maximum Number of Chords in a Cycle of a Graph. [Citation Graph (0, 0)][DBLP]
Ars Comb., 1997, v:46, n:, pp:- [Journal]
- Charles Vanden Eynden
Decomposition of Complete Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
Ars Comb., 1997, v:46, n:, pp:- [Journal]
- Xuding Zhu
A note on graph reconstruction. [Citation Graph (0, 0)][DBLP]
Ars Comb., 1997, v:46, n:, pp:- [Journal]
|
