Acta Mathematicae Applicatae Sinica, English Series

, Volume 19, Issue 3, pp 437–446 | Cite as

Maximum Genus of Strong Embeddings

  • Er-ling Wei
  • Yan-pei Liu
  • Han Ren
Original papers

Abstract

The strong embedding conjecture states that any 2-connected graph has a strong embedding on some surface. It implies the circuit double cover conjecture: Any 2-connected graph has a circuit double cover. Conversely, it is not true. But for a 3-regular graph, the two conjectures are equivalent. In this paper, a characterization of graphs having a strong embedding with exactly 3 faces, which is the strong embedding of maximum genus, is given. In addition, some graphs with the property are provided. More generally, an upper bound of the maximum genus of strong embeddings of a graph is presented too. Lastly, it is shown that the interpolation theorem is true to planar Halin graph.

Keywords

CDC Halin graph strong embedding genus surface 

2000 MR Subject Classification

05C10 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alspach, B. The classification of Hamiltonian generalized Petersen graphs. J. Comb. Th. (Series B), 34:293–312 (1983)CrossRefGoogle Scholar
  2. 2.
    Blanuša, D. Problem cetiriju Boja (Croatian). Hrvatsko Priordoslorno Društvo Glasnik, Mat–Fiz., Astr. II, 1:31–42 (1946)Google Scholar
  3. 3.
    Bondy, J.A., Murty, U.S.R. Graph theory with applications. Elsevier, New York, 1976Google Scholar
  4. 4.
    Fiorini, S., Wilson, R.J. Edge colorings of graphs. In:Selected topics in graph theory, Beineke, L.W., Wilson, R.J. ed., Academic Press, London, 102–126, 1978Google Scholar
  5. 5.
    Hajiaghaee, M.T., Mahmoodian, E.S., Mirrokni, V.S., Saberi, A., Tusserkani, K. On the simultaneous edge–coloring conjecture. Disc. Math., 216:267–272 (2000)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Huang, Y.Q. On the maximum genus of graphs. Ph.D. dissertation, Academia Sinica & Northern Jiaotong University, 1996Google Scholar
  7. 7.
    Little, C.H.C., Rinngeisen, R.D. On the strong graph embedding conjecture. Pro. 9–th Southeastern Conf. Comb. Graph Theory and Computer., Utilitas Math., Winnipeg, 479–487, 1978Google Scholar
  8. 8.
    Liu, Y.P. Embeddability in Graphs. Kluwer, Boston, 1995Google Scholar
  9. 9.
    Liu, Y.P. New approaches to the conjecture on double covering of graphs by circuits. OR Transactions, 4:50–54, (2000)Google Scholar
  10. 10.
    Liu, Y.P. The maximum non–orientable genus of a graph. Scientia Sinica, Special Issue on Math., I:191–201 (1979)Google Scholar
  11. 11.
    Robertson, N., Zha, X. Closed 2–cell embeddings of graphs with no V8–minors. Discrete Math., 230:207–213 (2001)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Seymour, P.D. Sum of circuits. Graph theory and related topics, Academic Press, New York, 342–355, 1979Google Scholar
  13. 13.
    Vizing, V.G. On an estimate of the chromatic class of a p–graph. Diskret Analiz., 3:25–30 (1964) (in Russian)Google Scholar
  14. 14.
    Wei, E.L., Liu, Y.P. Determination of regular embeddings of graphs on surfaces. Utilitas Math., 59:237–251 (2001)MathSciNetGoogle Scholar
  15. 15.
    Wei, E.L., Liu, Y.P. A note of interpolation theorem. Proceedings of the 9–th Bellman Continuum International Workshop on Uncertain Systems and Soft Computing, 2:318–322, 2002Google Scholar
  16. 16.
    Xuong, N.H. How to determine the maximum genus of a graph. J. Comb. Th. (Series B), 26:217–225 (1979)MathSciNetCrossRefGoogle Scholar
  17. 17.
    Zha, X. Closed 2–cell embeddings of 5–cross–cap embeddable graphs. Europ. J. Comb., 18:461–477 (1997)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Er-ling Wei
    • 1
  • Yan-pei Liu
    • 2
  • Han Ren
    • 3
  1. 1.Department of MathematicsRenming University of ChinaBeijingChina
  2. 2.Department of MathematicsNorthern Jiaotong UniversityBeijingChina
  3. 3.Department of mathematicsEast China Normal UniversityShanghaiChina

Personalised recommendations