×

The point-outercoarseness of complete n-partite graphs. (English) Zbl 0255.05101


MSC:

05C10 Planar graphs; geometric and topological aspects of graph theory
05Cxx Graph theory
PDFBibTeX XMLCite
Full Text: Numdam EuDML

References:

[1] L.W. Beineke [1] Genus, thickness, coarseness, and a crossing number , Proc. 1966 Symp. on Graph Theory, Tihany, Acad. Sci. Hung., 1967.
[2] L.W. Beineke and G. Chartrand [2] The coarseness of a graph , Comp. Math. 19 (1969), 290-298. · Zbl 0176.22302
[3] L.W. Beineke and R.K. Guy [3] The coarseness of the complete bigraph , Canad. J. Math. 21 (1969), 1086-1096. · Zbl 0186.27603 · doi:10.4153/CJM-1969-121-3
[4] G. Chartrand , D. Geller and S. Hedetniemi [4] Graphs with forbidden subgraphs , J. Combinatorial Theory, 10 (1971), 12-41. · Zbl 0223.05101 · doi:10.1016/0095-8956(71)90065-7
[5] G. Chartrand and F. Harary [5] Planar permutation graphs , Ann. Inst. H. Poincaré (Sect. B), 3 (1967), 433-438. · Zbl 0162.27605
[6] G. Chartrand , H.V. Kronk and C.E. Wall [6] The point-arboricity of a graph . Israel J. Math., 6 (1968) 168-175. · Zbl 0164.54201 · doi:10.1007/BF02760181
[7] K. Corrádi and A. Hajnal [7] On the maximal number of independent circuits in a graph . Acta Math. Acad. Sci. Hungar. 14 (1963), 423-439. · Zbl 0118.19001 · doi:10.1007/BF01895727
[8] G. Dirac and P. Erdös [8] On the maximal number of independent circuits in a graph . Acta Math. Acad. Sci. Hungar. 14 (1963), 79-93. · Zbl 0122.24903 · doi:10.1007/BF01901931
[9] R.K. Guy [9] A coarseness conjecture of Erdös , J. Comb. Theory, 3 (1967), 38-42. · Zbl 0149.41501 · doi:10.1016/S0021-9800(67)80014-0
[10] F. Harary [10] Graph Theory , Addison-Wesley, Reading, Mass., 1969, 94-97. · Zbl 0182.57702
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.