×

zbMATH — the first resource for mathematics

Maximum k-colorable subgraphs. (English) Zbl 0475.05034

MSC:
05C15 Coloring of graphs and hypergraphs
05C35 Extremal problems in graph theory
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] , and , Extremal k-colourable subgraphs. To appear. · Zbl 0536.05029
[2] private communication.
[3] and , Largest bipartite subgraphs in triangle-free graphs with maximum degree three. To appear. · Zbl 0609.05046
[4] Brooks, Proc. Cambridge Philos. Soc. 37 pp 194– (1941)
[5] Edwards, Canad. J. Math. 25 pp 475– (1973) · Zbl 0254.05116 · doi:10.4153/CJM-1973-048-x
[6] and , To appear.
[7] Erdös, Mat. Lapok. 18 pp 283– (1964)
[8] Erdös, Isr. J. Math. 3 pp 113– (1965)
[9] Problems and results in graph theory and combinatorial analysis. In Graph Theory and Related Topics (Proc. Waterloo Conf., Waterloo, 1977), Academic, New York (1979), pp. 153–163.
[10] Hopkins, J. Graph Theory 6 pp 115– (1982)
[11] Staton, Ars Combinatoria 10 pp 103– (1980)
[12] Node- and edge-deletion NP-complete problems. In Proceedings, 10th Annual ACM Symposium on the Theory of Computing. Association for Computing Machinery, New York (1978), pp. 253–264.
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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.