Mitchem, John
The point-outercoarseness of complete n-partite graphs
Compositio Mathematica, Tome 26 (1973) no. 2 , p. 101-110
Zbl 0255.05101 | MR 382079
URL stable : http://www.numdam.org/item?id=CM_1973__26_2_101_0

Bibliographie

L.W. Beineke [1] Genus, thickness, coarseness, and a crossing number, Proc. 1966 Symp. on Graph Theory, Tihany, Acad. Sci. Hung., 1967.

L.W. Beineke and G. Chartrand [2] The coarseness of a graph, Comp. Math. 19 (1969), 290-298. Numdam | MR 240002 | Zbl 0176.22302

L.W. Beineke and R.K. Guy [3] The coarseness of the complete bigraph, Canad. J. Math. 21 (1969), 1086-1096. MR 262117 | Zbl 0186.27603

G. Chartrand, D. Geller and S. Hedetniemi [4] Graphs with forbidden subgraphs, J. Combinatorial Theory, 10 (1971), 12-41. MR 285427 | Zbl 0223.05101

G. Chartrand and F. Harary [5] Planar permutation graphs, Ann. Inst. H. Poincaré (Sect. B), 3 (1967), 433-438. Numdam | MR 227041 | Zbl 0162.27605

G. Chartrand, H.V. Kronk and C.E. Wall [6] The point-arboricity of a graph. Israel J. Math., 6 (1968) 168-175. MR 236049 | Zbl 0164.54201

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. MR 200185 | Zbl 0118.19001

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. MR 148054 | Zbl 0122.24903

R.K. Guy [9] A coarseness conjecture of Erdös, J. Comb. Theory, 3 (1967), 38-42. MR 216983 | Zbl 0149.41501

F. Harary [10] Graph Theory, Addison-Wesley, Reading, Mass., 1969, 94-97. MR 256911 | Zbl 0182.57702