Journal: Discrete Applied Mathematics

Found 533 papers in total
A note on compact graphs
1991,
An undirected simple graph G is called compact iff its adjacency matrix A is such that...
Recognizing brittle graphs: Remarks on a paper of Hoàng and Khouzam
1991,
A graph is perfect if the size of the maximum clique equals the chromatic number in...
Cut-threshold graphs
1991,
The authors study the structure of the networks in which connectedness and...
The continuous center set of a network
1991,
The continuous radius of a network N is the minimum for all points of N (i.e.,...
Uniqueness of currents in infinite resistive networks
1991,
If an infinite resistive network, whose edges have resistance 1ohm, satisfies a...
Papers per page: