Dense circuit graphs and the planar Turán number of a cycle

被引:0
|
作者
Shi, Ruilin [1 ]
Walsh, Zach [1 ]
Yu, Xingxing [1 ]
机构
[1] School of Mathematics, Georgia Institute of Technology, Atlanta,GA, United States
来源
Journal of Graph Theory | / 1卷 / 27-38期
基金
美国国家科学基金会;
关键词
Graph theory - Graphic methods - Timing circuits;
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
相关论文
共 50 条
  • [21] On the Characterization of Maximal Planar Graphs with a Given Signed Cycle Domination Number
    Xiao Ming PI
    ActaMathematicaSinica, 2018, 34 (05) : 911 - 920
  • [22] On the Characterization of Maximal Planar Graphs with a Given Signed Cycle Domination Number
    Pi, Xiao Ming
    ACTA MATHEMATICA SINICA-ENGLISH SERIES, 2018, 34 (05) : 911 - 920
  • [23] The Turán Number Of The Fano Plane
    Peter Keevash
    Benny Sudakov*
    Combinatorica, 2005, 25 : 561 - 574
  • [24] Random planar graphs with n nodes and a fixed number of edges
    Gerke, Stefanie
    McDiarmid, Colin
    Steger, Angelika
    Weissl, Andreas
    PROCEEDINGS OF THE SIXTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2005, : 999 - 1007
  • [25] Induced Turán problem in bipartite graphs
    Axenovich, Maria
    Zimmermann, Jakob
    DISCRETE APPLIED MATHEMATICS, 2025, 360 : 497 - 505
  • [26] Turán Numbers for Disjoint Copies of Graphs
    Izolda Gorgol
    Graphs and Combinatorics, 2011, 27 : 661 - 667
  • [27] The Ramsey number of dense graphs
    Conlon, David
    BULLETIN OF THE LONDON MATHEMATICAL SOCIETY, 2013, 45 : 483 - 496
  • [28] The interval number of dense graphs
    Balogh, J
    Pluhár, A
    DISCRETE MATHEMATICS, 2002, 256 (1-2) : 423 - 429
  • [29] Turán Numbers of Several Bipartite Graphs
    Ye Wang
    Yusheng Li
    Yan Li
    Graphs and Combinatorics, 2024, 40
  • [30] Decomposition of Directed Graphs and the Turán Problem
    B. V. Novikov
    L. Yu. Polyakova
    G. N. Zholtkevich
    Ukrainian Mathematical Journal, 2014, 66 : 1070 - 1084