Geodesic
On a characterization of graphs by average labellings
Discussiones Mathematicae. Graph Theory, Tome 17 (1997) no. 1, pp. 133-136.

Voir la notice de l'article provenant de la source Library of Science

The additive hereditary property of linear forests is characterized by the existence of average labellings.
Keywords: property of graphs, additive, hereditary, linear forest 
@article{DMGT_1997_17_1_a9,
     author = {Harminc, Mat\'u\v{s}},
     title = {On a characterization of graphs by average labellings},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {133--136},
     publisher = {mathdoc},
     volume = {17},
     number = {1},
     year = {1997},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_1997_17_1_a9/}
}
TY  - JOUR
AU  - Harminc, Matúš
TI  - On a characterization of graphs by average labellings
JO  - Discussiones Mathematicae. Graph Theory
PY  - 1997
SP  - 133
EP  - 136
VL  - 17
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_1997_17_1_a9/
LA  - en
ID  - DMGT_1997_17_1_a9
ER  - 
%0 Journal Article
%A Harminc, Matúš
%T On a characterization of graphs by average labellings
%J Discussiones Mathematicae. Graph Theory
%D 1997
%P 133-136
%V 17
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_1997_17_1_a9/
%G en
%F DMGT_1997_17_1_a9
Harminc, Matúš. On a characterization of graphs by average labellings. Discussiones Mathematicae. Graph Theory, Tome 17 (1997) no. 1, pp. 133-136. http://geodesic.mathdoc.fr/item/DMGT_1997_17_1_a9/

[1] C. Berge, Graphes et Hypergraphes (Paris, Dunod 1970).

[2] M. Borowiecki, I. Broere, M. Frick, P. Mihók and G. Semanišin, A Survey of Hereditary Properties of Graphs, Discussiones Mathematicae Graph Theory 17 (1997) 5-50, doi: 10.7151/dmgt.1037.

[3] M. Borowiecki, P. Mihók, Hereditary properties of graphs, in: V.R. Kulli, ed. Advances in Graph Theory (Vishwa International Publication, 1991) 41-68.

[4] D. Gernet, Forbidden and unavoidable subgraphs, Ars Combinatoria 27 (1989) 165-176.

[5] D.L. Greenwell, R.L. Hemminger and J. Klerlein, Forbidden subgraphs, in: Proc. 4th S-E Conf. Combinatorics, Graph Theory and Computing, Utilitas Math. (1973) 389-394.

[6] M. Harminc and R. Soták, Graphs with average labellings, (1996) manuscript.

[7] S. Jezný and M. Trenkler, Characterization of magic graphs, Czechoslovak Math. J. 33 (1983) 435-438.

[8] P. Mihók, On graphs critical with respect to generalized independence numbers, Colloquia Mathematica Societatis János Bolyai-Combinatorics 52 (1987) 417-421.

[9] P. Mihók, On the minimal reducible bound for outerplanar and planar graphs, Discrete Math. 150 (1996) 431-435, doi: 10.1016/0012-365X(95)00211-E.