Full entry |
PDF
(0.3 MB)
Feedback

stratified graph; homogeneous embedding; framing number; fencing number

References:

[1] G. Chartrand, Heather J. Gavlas, M. Schultz: **Framed! A graph embedding problem**. Bull. Inst. Comb. Appl. 4 (1992), 35–50. MR 1147971

[2] G. Chartrand, L. Eroh, R. Rashidi, M. Schultz, N. A. Sherwani: **Distance, stratified graphs, and greatest stratified subgraphs**. Congr. Numerantium 107 (1995), 81–96. MR 1369256

[3] G. Chartrand, H. Gavlas, M. A. Henning, R. Rashidi: **Stratidistance in stratified graphs**. Math. Bohem. 122 (1997), 337–347. MR 1489394

[4] G. Chartrand, T. W. Haynes, M. A. Henning, P. Zhang: **Stratification and domination in graphs**. Discrete Math. 272 (2003), 171–185. DOI 10.1016/S0012-365X(03)00078-5 | MR 2009541

[5] G. Chartrand, T. W. Haynes, M. A. Henning, P. Zhang: **Stratified claw domination in prisms**. J. Comb. Math. Comb. Comput. 33 (2000), 81–96. MR 1772755

[6] G. Chartrand, L. Hansen, R. Rashidi, N. A. Sherwani: **Distance in stratified graphs**. Czechoslovak Math. J. 125 (2000), 35–46. MR 1745456

[7] P. Erdős, P. Kelly: **The minimum regular graph containing a given graph**. A Seminar on Graph Theory, F. Harary (ed.), Holt, Rinehart and Winston, New York, 1967, pp. 65–69. MR 0223264

[8] D. König: **Theorie der endlichen und unendlichen Graphen**. Leipzig, 1936. Reprinted Chelsea, New York, 1950.