Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
7-cycles
Description:
Cycles containing seven edges or vertices in graph theory, particularly in studies of planar graphs and coloring.
Primary topic:
Advanced Graph Theory Research (54%)
Related topics:
Advanced Graph Theory Research (54%),
Graph Labeling and Dimension Problems (17%)
OpenAlex ID:
keywords/7-cycles
Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable
2008
·
O.V. Borodin
, A.N. Glebov
, et al.
·
Journal of Combinatorial Theory Series B
·
51
Planar Graphs without 7-Cycles Are 4-Choosable
2009
·
Babak Farzad
·
SIAM Journal on Discrete Mathematics
·
40
On 3-colorable plane graphs without 5- and 7-cycles
2006
·
Baogang Xu
·
Journal of Combinatorial Theory Series B
·
39
PDF
Acyclic 4-Choosability of Planar Graphs Without Cycles of Specific Lengths
2007
·
Mickaël Montassier
, André Raspaud
, et al.
·
Springer eBooks
·
38
Improved lower bound on the Shannon capacity of C7
2002
·
Aleksander Vesel
, Janez Žerovnik
·
Information Processing Letters
·
33
On the vertex-arboricity of planar graphs without 7-cycles
2012
·
Danjun Huang
, Wai Chee Shiu
, et al.
·
Discrete Mathematics
·
31
PDF
Planar Turán number of the 7-cycle
2025
·
Ruilin Shi
, Zach Walsh
, et al.
·
European Journal of Combinatorics
·
29
PDF
The 7-cycle C7 is light in the family of planar graphs with minimum degree 5
2006
·
T. Madaras
, R. Škrekovski
, et al.
·
Discrete Mathematics
·
21
PDF
A note on 3-choosability of planar graphs
2007
·
Yingqian Wang
, Huajing Lu
, et al.
·
Information Processing Letters
·
19
Knots and Links in Certain Spatial Complete Graphs
1996
·
Takashi Otsuki
·
Journal of Combinatorial Theory Series B
·
17
PDF
On total isolation in graphs
2024
·
Geoffrey Boyer
, Wayne Goddard
, et al.
·
Aequationes Mathematicae
·
15
New Methods in Coding Theory: Error-Correcting Codes and the Shannon Capacity
2020
·
Polak, Sven
·
arXiv (Cornell University)
·
14
PDF
Edge-choosability of planar graphs without adjacent triangles or without 7-cycles
2008
·
Jianfeng Hou
, Guizhen Liu
, et al.
·
Discrete Mathematics
·
14
PDF
Planar graphs without 3-, 7-, and 8-cycles are 3-choosable
2009
·
Zdeněk Dvořák
, Bernard Lidický
, et al.
·
Discrete Mathematics
·
13
PDF
On the 3-colorability of planar graphs without 4-, 7- and 9-cycles
2009
·
Huajing Lu
, Yingqian Wang
, et al.
·
Discrete Mathematics
·
13
On 3-colorable planar graphs without cycles of four lengths
2007
·
Xiaofang Luo
, Min Chen
, et al.
·
Information Processing Letters
·
12
On 3-choosability of plane graphs without 6-, 7- and 9-cycles
2004
·
Haihui Zhang
, Baogang Xu
·
Applied mathematics/Applied Mathematics. A Journal of Chinese Universities/Gao-xiao yingyong shuxue xuebao
·
11
On the number of 7-cycles in regular n-tournaments
2016
·
S.V. Savchenko
·
Discrete Mathematics
·
10
PDF
Planar graphs without 7-cycles and butterflies are DP-4-colorable
2019
·
Seog-Jin Kim
, Runrun Liu
, et al.
·
Discrete Mathematics
·
9
PDF
Plane Graphs without 4- and 5-Cycles and without Ext-Triangular 7-Cycles are 3-Colorable
2017
·
Ligang Jin
, Yingli Kang
, et al.
·
SIAM Journal on Discrete Mathematics
·
9
PDF
On the Number of Cycles in a Graph
2016
·
Nazanin Movarraei
, Samina A. Boxwala
·
Open Journal of Discrete Mathematics
·
9
PDF
Planar graphs without cycles of length 4 or 7 are (2, 0, 0)-colorable
2014
·
PeiPei LIU
, YingQian WANG
·
Scientia Sinica Mathematica
·
9
Black hole uniqueness theorems and new thermodynamic identities in eleven dimensional supergravity
2012
·
Stefan Hollands
·
Classical and Quantum Gravity
·
9
PDF
A Note on 3-colorable Plane Graphs Without 5- and 7-cycles
2009
·
BAOGANG XU
·
Discrete Mathematics Algorithms and Applications
·
9
PDF
On 3-colorable planar graphs without short cycles
2007
·
Min Chen
, Weifan Wang
·
Applied Mathematics Letters
·
9
Show more works
View as search
Works count:
92
Citation count:
610
Year
Topic
Type