본문 바로가기
KERD
논문KCI 등재

Light 3-cycles in 1-planar graphs with degree restrictions

0

조회

0

다운로드

1

인용

0

참고문헌

키워드

주제분류수학

초록

In this paper, we prove that the 3-cycle is light in the family of 1-planar graphs with minimum vertex degree at least 5 and minimum edge degree at least 12. This generates a known result of Fabrici and Madaras [8].

Abstract

In this paper, we prove that the 3-cycle is light in the family of 1-planar graphs with minimum vertex degree at least 5 and minimum edge degree at least 12. This generates a known result of Fabrici and Madaras [8].

참고문헌 (24)

  1. M. O. Albertson, "Coloring vertices and faces of locally planar graphs", Graphs Combin, 22(3), pp.289~295 (2006)
  2. J. A. Bondy, "Graph Theory with Applications" (1976), North-Holland
  3. O. V. Borodin, "Solution of the Ringel problem on vertex-face coloring of planar graphs and coloring of 1-planar graphs", Metody Diskret. Analiz, 41, pp.12~26 (1984)
  4. O. V. Borodin, "A new proof of the six color theorem", J. Graph Theory, 19(4), pp.507~521 (1995)
  5. O. V. Borodin, "The height of a cycle of length 4 in 1-planar graphs with minimal degree 5 without triangles", J. Appl. Ind. Math, 3(1), pp.28~31 (2009)
  6. O. V. Borodin, "Acyclic colouring of 1-planar graphs", Discrete Appl. Math, 114(1-3), pp.29~41 (2001)
  7. W. Dong, "Light paths of 1-planar graphs with bounded minimum degree", ~
  8. I. Fabrici, "The structure of 1-planar graphs", Discrete Math, 307(7-8), pp.854~865 (2007)
  9. D. Hud´ak, "On local structures of 1-planar graphs of minimum degree 5 and girth 4", Discuss. Math. Graph Theory, 29(2), pp.385~400 (2009)
  10. D. Hud´ak, "On local properties of 1-planar graphs with high minimum degree", Ars Math. Contemp, 4(2), pp.245~254 (2011)
  11. D. Hud´ak, "Light edges in 1-planar graphs with prescribed minimum degree", Discuss. Math. Graph Theory, 32(3), pp.545~556 (2012)
  12. S. Jendrol’, "On light cycles in plane triangulations", Discrete Math, 197, pp.198 (1999), 453~467
  13. V. P. Korzhik, "Minimal obstructions for 1-immersions and hardness of 1-planarity test", Springer Lecture Notes in Computer Science, 5417, pp.302~312 (2009)
  14. G. Ringel, "Ein sechsfarbenproblem auf der Kugel", Abh. Math. Sem. Univ. Hamburg, 29, pp.107~117 (1965)
  15. X. Zhang, "On total colorings of 1-planar graphs", J. Comb. Optim[DOI]
  16. X. Zhang, "On edge colorings of 1-planar graphs without adjacent triangles", Inform. Process. Lett, 112(4), pp.138~142 (2012)
  17. X. Zhang, "On edge colorings of 1-planar graphs without chordal 5-cycles", Ars Combin, 104, pp.431~436 (2012)
  18. X. Zhang, "On the lightness of chordal 4-cycle in 1-planar graphs with high minimum degree", Ars Mathematica Contemporanea, 7(2), pp.281~291 (2014)
  19. X. Zhang, "Structural properties of 1-planar graphs and an appli-cation to acyclic edge coloring", Scientia Sinica Mathematica, 40, pp.1025~1032 (2010)
  20. X. Zhang, "Light subgraphs in the family of 1-planar graphs with high minimum degree", Acta Math. Sin. (Engl. Ser.), 28(6), pp.1155~1168 (2012)
  21. X. Zhang, "On edge colorings of 1-planar graphs", Inform. Process. Lett, 111(3), pp.124~128 (2011)
  22. X. Zhang, "New upper bounds for the heights of some light sub-graphs in 1-planar graphs with high minimum degree", Discrete Math. Theor. Comput. Sci, 13(3), pp.9~16 (2011)
  23. X. Zhang, "List edge and list total coloring of 1-planar graphs", Front. Math. China, 7(5), pp.1005~1018 (2012)
  24. X. Zhang, "On (p, 1)-total labelling of 1-planar graphs", Cent. Eur. J. Math, 9(6), pp.1424~1434 (2011)

관련 논문AI추천

이 간행물의 다른 논문 (23건)