Mihok, Peter On graphs critical with respect to vertex partition numbers. (English) Zbl 0471.05038 Discrete Math. 37, 123-126 (1981). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 1 Document MSC: 05C35 Extremal problems in graph theory Keywords:vertex partition number; k-degenerated graphs Citations:Zbl 0323.05101 PDFBibTeX XMLCite \textit{P. Mihok}, Discrete Math. 37, 123--126 (1981; Zbl 0471.05038) Full Text: DOI References: [1] Behzad, M.; Chartrand, G., Introduction to the Theory of Graphs (1971), Allyn and Bacon: Allyn and Bacon Boston · Zbl 0177.52403 [2] Bollobás, B.; Harary, F., Point arboricity critical graphs exist, J. London Math. Soc., 12, 2, 97-102 (1975) · Zbl 0323.05101 [3] Gallai, T., Kritische Graphen I, Publ. Math. Inst. Hung. Acad. Sci., 8, 165-192 (1963) · Zbl 0121.18401 [4] Kronk, H. V.; Mitchem, J., Critical point arboritic graphs, J. London Math. Soc., 9, 2, 459-466 (1975) · Zbl 0298.05132 [5] Lick, D. R.; White, A. T., \(k\)-degenerate graphs, Canad. J. Math., 22, 1082-1096 (1970) · Zbl 0202.23502 [6] Mihók, P., On the point arboricity critical graphs, (Graphs, Hypergraphs and Block Systems (1976), Zielona Górs) · Zbl 0344.05157 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.