On a characterization of graphs by average labellings
Discussiones Mathematicae Graph Theory (1997)
- Volume: 17, Issue: 1, page 133-136
- ISSN: 2083-5892
Access Full Article
top
Abstract
topHow to cite
topMatúš Harminc. "On a characterization of graphs by average labellings." Discussiones Mathematicae Graph Theory 17.1 (1997): 133-136. <http://eudml.org/doc/270251>.
@article{MatúšHarminc1997,
abstract = {The additive hereditary property of linear forests is characterized by the existence of average labellings.},
author = {Matúš Harminc},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {property of graphs; additive; hereditary; linear forest; graph labeling; average labeling; characterization; hereditary graph properties; forests},
language = {eng},
number = {1},
pages = {133-136},
title = {On a characterization of graphs by average labellings},
url = {http://eudml.org/doc/270251},
volume = {17},
year = {1997},
}
TY - JOUR
AU - Matúš Harminc
TI - On a characterization of graphs by average labellings
JO - Discussiones Mathematicae Graph Theory
PY - 1997
VL - 17
IS - 1
SP - 133
EP - 136
AB - The additive hereditary property of linear forests is characterized by the existence of average labellings.
LA - eng
KW - property of graphs; additive; hereditary; linear forest; graph labeling; average labeling; characterization; hereditary graph properties; forests
UR - http://eudml.org/doc/270251
ER -
References
top- [1] C. Berge, Graphes et Hypergraphes (Paris, Dunod 1970). Zbl0213.25702
- [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. Zbl0902.05026
- [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. Zbl0673.05047
- [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. Zbl0312.05128
- [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. Zbl0571.05030
- [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. Zbl0911.05043
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.