The point-outercoarseness of complete -partite graphs
Compositio Mathematica (1973)
- Volume: 26, Issue: 2, page 101-110
- ISSN: 0010-437X
Access Full Article
topHow to cite
topMitchem, John. "The point-outercoarseness of complete $n$-partite graphs." Compositio Mathematica 26.2 (1973): 101-110. <http://eudml.org/doc/89155>.
@article{Mitchem1973,
author = {Mitchem, John},
journal = {Compositio Mathematica},
language = {eng},
number = {2},
pages = {101-110},
publisher = {Noordhoff International Publishing},
title = {The point-outercoarseness of complete $n$-partite graphs},
url = {http://eudml.org/doc/89155},
volume = {26},
year = {1973},
}
TY - JOUR
AU - Mitchem, John
TI - The point-outercoarseness of complete $n$-partite graphs
JO - Compositio Mathematica
PY - 1973
PB - Noordhoff International Publishing
VL - 26
IS - 2
SP - 101
EP - 110
LA - eng
UR - http://eudml.org/doc/89155
ER -
References
top- 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. Zbl0176.22302MR240002
- L.W. Beineke and R.K. Guy [3] The coarseness of the complete bigraph, Canad. J. Math.21 (1969), 1086-1096. Zbl0186.27603MR262117
- G. Chartrand, D. Geller and S. Hedetniemi [4] Graphs with forbidden subgraphs, J. Combinatorial Theory, 10 (1971), 12-41. Zbl0223.05101MR285427
- G. Chartrand and F. Harary [5] Planar permutation graphs, Ann. Inst. H. Poincaré (Sect. B), 3 (1967), 433-438. Zbl0162.27605MR227041
- G. Chartrand, H.V. Kronk and C.E. Wall [6] The point-arboricity of a graph. Israel J. Math., 6 (1968) 168-175. Zbl0164.54201MR236049
- 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. Zbl0118.19001MR200185
- 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. Zbl0122.24903MR148054
- R.K. Guy [9] A coarseness conjecture of Erdös, J. Comb. Theory, 3 (1967), 38-42. Zbl0149.41501MR216983
- F. Harary [10] Graph Theory, Addison-Wesley, Reading, Mass., 1969, 94-97. Zbl0182.57702MR256911
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.