최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기Discrete mathematics, v.307 no.2, 2007년, pp.181 - 190
Dvorak, Z. , Skrekovski, R. , Valla, T.
The gravity of a graph H in a given family of graphs H is the greatest integer n with the property that for every integer m, there exists a supergraph G@?H of H such that each subgraph of G, which is isomorphic to H, contains at least n vertices of degree >=m in G. Madaras and Skrekovski introduced ...
Mat. Zametki Borodin 46 9 1989 Solution of problems of Kotzig and Grunbaum concerning the isolation of cycles in planar graphs
J. Reine Angew. Math. Borodin 394 180 1989 On the total colorings of planar graphs
Discrete Math. Fabrici 212 61 2000 10.1016/S0012-365X(99)00209-5 On vertex-degree restricted paths in polyhedral graphs
Graphs Combin. Fabrici 13 245 1997 10.1007/BF03353001 Subgraphs with restricted degrees of their vertices in planar 3-connected graphs
J. Combin. Theory Ser. B Harant 77 150 1999 10.1006/jctb.1999.1918 On 3-connected plane graphs without triangular faces
Discuss. Math. Graph Theory Jendrol’ 16 207 1996 10.7151/dmgt.1035 On light subgraphs in plane graphs of minimum degree five
Discrete Math. Jendrol’ 197/198 453 1999 10.1016/S0012-365X(99)90099-7 On light cycles in plane triangulations
S. Jendrol’, H.-J. Voss, Light subgraphs of graphs embedded in plane and projective plane-a survey, Preprint Institute of Algebra MATH-AL-XX-1999, TU Dresden.
Mat. as. SAV (Math. Slovaca) Kotzig 5 101 1955 Contribution to the theory of Eulerian polyhedra
Discrete Math. Madaras 286 115 2004 10.1016/j.disc.2003.11.052 Heavy paths, light stars and big melons
10.1016/j.disc.2005.11.042 T. Madaras, R. ?krekovski, Lightness, heaviness and gravity, Discrete Math., in press, 10.1016/j.disc.2005.11.042.
Tatra Mountains Math. Publ. Madaras 18 35 1999 The 10-cycle C10 is light in the family of all plane triangulations with minimum degree five
J. Graph Theory Mohar 44 261 2003 10.1002/jgt.10144 Light subgraphs in planar graphs of minimum degree 4 and edge degree 9
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.