Geodesic
On a generalization of perfect $b$-matching
Mathematica Bohemica, Tome 116 (1991) no. 4, pp. 380-384

Voir la notice de l'article provenant de la source Czech Digital Mathematics Library

MR Zbl
The paper is concerned with the existence of non-negative or positive solutions to $Af=\beta$, where $A$ is the vertex-edge incidence matrix of an undirected graph. The paper gives necessary and sufficient conditions for the existence of such a solution.
The paper is concerned with the existence of non-negative or positive solutions to $Af=\beta$, where $A$ is the vertex-edge incidence matrix of an undirected graph. The paper gives necessary and sufficient conditions for the existence of such a solution.
DOI : 10.21136/MB.1991.126032
Classification : 05C50, 68E10, 68R10
Keywords: perfect $b$-matching; beta-non-negative and beta-positive graphs; systems of linear equations 
Šándorová, Ľubica; Trenkler, Marián. On a generalization of perfect $b$-matching. Mathematica Bohemica, Tome 116 (1991) no. 4, pp. 380-384. doi: 10.21136/MB.1991.126032
@article{10_21136_MB_1991_126032,
     author = {\v{S}\'andorov\'a, \v{L}ubica and Trenkler, Mari\'an},
     title = {On a generalization of perfect $b$-matching},
     journal = {Mathematica Bohemica},
     pages = {380--384},
     year = {1991},
     volume = {116},
     number = {4},
     doi = {10.21136/MB.1991.126032},
     mrnumber = {1146395},
     zbl = {0735.68068},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/MB.1991.126032/}
}
TY  - JOUR
AU  - Šándorová, Ľubica
AU  - Trenkler, Marián
TI  - On a generalization of perfect $b$-matching
JO  - Mathematica Bohemica
PY  - 1991
SP  - 380
EP  - 384
VL  - 116
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.21136/MB.1991.126032/
DO  - 10.21136/MB.1991.126032
LA  - en
ID  - 10_21136_MB_1991_126032
ER  - 
%0 Journal Article
%A Šándorová, Ľubica
%A Trenkler, Marián
%T On a generalization of perfect $b$-matching
%J Mathematica Bohemica
%D 1991
%P 380-384
%V 116
%N 4
%U http://geodesic.mathdoc.fr/articles/10.21136/MB.1991.126032/
%R 10.21136/MB.1991.126032
%G en
%F 10_21136_MB_1991_126032

[1] C. Berge: Regularisable Graphs II. Discrete Math. 23 (1978), 91 - 95. | DOI | MR | Zbl

[2] S. Jezný M. Trenkler: Characterization of Magic Graphs. Czech. Math. J. 33 (1983), 435-438. | MR

[3] R. H. Jeurissen: The Incidence Matrix and Labellings of a Graph. J. Comb. Theory B 30 (1981), 290-301. | DOI | MR | Zbl

[4] B. Grünbaum: Convex Polytopes. Interscience, London 1967. | MR

[5] L. Lovász M. D. Plummer: Matching Theory. Akadémiai kiadó, Budapest 1986. | MR

[6] Ľ. Šándorová M. Trenkler: On a Generalization of Magic Graphs. Proc. of the 7th Hungarian Colloquium on Combinatorics, North Holland, 1988, 447-452. | MR

[7] B. M. Stewart: Magic Graphs. Canad. J. Math. 18 (1966), 1031-1059. | DOI | MR | Zbl

Cité par Sources :