Note on perfectly orderable graphs

被引:0
|
作者
机构
来源
Discrete Applied Mathematics | 1996年 / 65卷 / 1-3期
关键词
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
相关论文
共 50 条
  • [41] Perfectly antimagic total graphs
    Swathi, P.
    Kumar, G.
    Jeyabalan, R.
    Nishanthini, R.
    JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2023, 44 (01) : 1517 - 1523
  • [42] On Planar Perfectly Contractile Graphs
    Cláudia Linhares Sales
    Frédéric Maffray
    Bruce Reed
    Graphs and Combinatorics, 1997, 13 : 167 - 187
  • [43] A class of perfectly contractile graphs
    Maffray, F
    Trotignon, N
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2006, 96 (01) : 1 - 19
  • [44] Algorithms for perfectly contractile graphs
    Maffray, F
    Trotignon, N
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2005, 19 (03) : 553 - 574
  • [45] L(2,1)-labeling of dually chordal graphs and strongly orderable graphs
    Panda, B. S.
    Goel, Preeti
    INFORMATION PROCESSING LETTERS, 2012, 112 (13) : 552 - 556
  • [46] Cutting Barnette graphs perfectly is hard
    Bonnet, Edouard
    Chakraborty, Dibyayan
    Duron, Julien
    THEORETICAL COMPUTER SCIENCE, 2024, 1010
  • [47] Cutting Barnette Graphs Perfectly is Hard
    Bonnet, Edouard
    Chakraborty, Dibyayan
    Duron, Julien
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, WG 2023, 2023, 14093 : 116 - 129
  • [48] Perfectly balanced partitions of smoothed graphs
    Ben-Eliezer, Ido
    Krivelevich, Michael
    ELECTRONIC JOURNAL OF COMBINATORICS, 2009, 16 (01):
  • [49] ON PERFECTLY FRIENDLY BISECTIONS OF RANDOM GRAPHS
    Minzer, Dor
    Sah, Ashwin
    Sawhney, Mehtaab
    ANNALS OF PROBABILITY, 2024, 52 (06): : 2281 - 2341
  • [50] Computing a minimum paired-dominating set in strongly orderable graphs
    Pradhan, D.
    Panda, B. S.
    DISCRETE APPLIED MATHEMATICS, 2019, 253 : 37 - 50