An analogue of Franklin’s Theorem-Reference-Cited by-同舟云学术

An analogue of Franklin’s Theorem

Published:2016-10 Issue:10 Volume:339 Page:2553-2556
ISSN:0012-365X
Container-title:Discrete Mathematics
language:en
Short-container-title:Discrete Mathematics

Author:

Borodin O.V.,Ivanova A.O.

Funder

Russian Foundation for Basic Research

Government Support of the Leading Scientific Schools of the Russian Federation

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference35 articles.

1. Weight of 3-paths in sparse plane graphs;Aksenov;Electron. J. Combin.,2015

2. K. Ando, S. Iwasaki, A. Kaneko, Every 3-connected planar graph has a connected subgraph with small degree sum, in: Annual Meeting of Mathematical Society of Japan, 1993 (in Japanese).

3. Solution of Kotzig’s and Grünbaum’s problems on the separability of a cycle in a planar graph;Borodin;Mat. Zametki,1989

4. Structural properties of plane maps with minimum degree 5;Borodin;Math. Nachr.,1992

5. Structural theorem on plane graphs with application to the entire coloring;Borodin;J. Graph Theory,1996

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

1. Light 3-Paths in 3-Polytopes without Adjacent Triangles;Siberian Mathematical Journal;2024-03

2. A Tight Description of 3-Polytopes by Their Major 3-Paths;Siberian Mathematical Journal;2021-05

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

4. All tight descriptions of major $3$-paths in $3$-polytopes without $3$-vertices;Sibirskie Elektronnye Matematicheskie Izvestiya;2021-04-22

5. Soft 3-stars in sparse plane graphs;Sibirskie Elektronnye Matematicheskie Izvestiya;2020-11-18