## Abstract A marked graph is obtained from a graph by giving each point either a positive or a negative sign. Beineke and Harary raised the problem of characterzing consistent marked graphs in which the product of the signs of the points is positive for every cycle. In this paper a characterizatio
β¦ LIBER β¦
On the problem of consistent marking of a graph
β Scribed by Fred S. Roberts
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 583 KB
- Volume
- 217
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A characterization of consistent marked
β
Cornelis Hoede
π
Article
π
1992
π
John Wiley and Sons
π
English
β 364 KB
A note on the construction of marked gra
β
K. Thirusangu; K. Rangarajan
π
Article
π
1995
π
Elsevier Science
π
English
β 318 KB
A note on the bottleneck graph partition
β
Klinz, Bettina; Woeginger, Gerhard J.
π
Article
π
1999
π
John Wiley and Sons
π
English
β 47 KB
π 2 views
The bottleneck graph partition problem consists of partitioning the vertices of an undirected edge-weighted graph into two equally sized sets such that the maximum edge weight in the cut separating the two sets becomes minimum. In this short note, we present an optimum algorithm for this problem wit
On the consistency of the mass transfer
β
Juan GonzΓ‘lez-HernΓ‘ndez; J. Rigoberto Gabriel
π
Article
π
2006
π
Elsevier Science
π
English
β 161 KB
Conditions are given under which the Monge-Kantorovich mass transfer problem on general metric spaces and with unbounded cost function has a feasible solution.
Undecidability of the bandwidth problem
β
Egon Wanke; Manfred Wiegers
π
Article
π
1989
π
Elsevier Science
π
English
β 682 KB
A note on a problem of Smirnov. A graph
β
Ronald Alter; Bennet Lientz
π
Article
π
1970
π
John Wiley and Sons
π
English
β 107 KB