Joint extension of two theorems of Kotzig on 3-polytopes-Reference-Cited by-同舟云学术

Joint extension of two theorems of Kotzig on 3-polytopes

Published:1993-03 Issue:1 Volume:13 Page:121-125
ISSN:0209-9683
Container-title:Combinatorica
language:en
Short-container-title:Combinatorica

Author:

Borodin Oleg

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Discrete Mathematics and Combinatorics

Link

http://link.springer.com/content/pdf/10.1007/BF01202794.pdf

Reference8 articles.

1. O. V. Borodin: Simultaneous coloring the vertices, edges, and faces of planar graphs,Met. Diskr. Anal., Novosibirsk 47 (1988), 21?27 (in Russian).

2. O. V. Borodin: New structural properties of planar graphs with application in colorings,Proc. 33rd Int. Wiss. Kolloq. TH Ilmenau, Ilmenau, 1988, 159?162.

3. O. V. Borodin: On the total coloring of planar graphs,J. Reine Angew. Math. 394 (1989), 180?185.

4. B. Gr�nbaum: New views on some old questions of combinatorial geometry,Teorie Combinatorie, Accademia Nacionale dei Lincei Roma, 1976, Vol. I, 452?468.

5. A. Kotzig: Contribution to the theory of Eulerian polyhedra,Mat. ?as. 5 (1955), 233?237 (in Russian).

Cited by 23 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. DESCRIBING EDGES IN NORMAL PLANE MAPS HAVING NO ADJACENT 3-FACES;SIB ELECTRON MATH RE;2024

2. All tight descriptions of 3-paths in plane graphs with girth at least 7;Discrete Mathematics;2021-05

3. All tight descriptions of $3$-paths in plane graphs with girth at least $8$;Sibirskie Elektronnye Matematicheskie Izvestiya;2020-04-06

4. All tight descriptions of 3-paths centered at 2-vertices in plane graphs with girth at least 6;Sibirskie Elektronnye Matematicheskie Izvestiya;2019-09-27

5. Describing neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and without vertices of degrees from 7 to 11;Discussiones Mathematicae Graph Theory;2018