ACYCLIC ORIENTATIONS OF A GRAPH AND CHROMATIC AND INDEPENDENCE NUMBERS

被引:14
|
作者
DEMING, RW
机构
关键词
D O I
10.1016/0095-8956(79)90048-0
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
引用
收藏
页码:101 / 110
页数:10
相关论文
共 50 条
  • [41] THE CHROMATIC-NUMBERS OF GRAPH BUNDLES OVER CYCLES
    KLAVZAR, S
    MOHAR, B
    DISCRETE MATHEMATICS, 1995, 138 (1-3) : 301 - 314
  • [42] Embeddings of a Graph into a Surface with Different Weak Chromatic Numbers
    Kengo Enami
    Kenta Noguchi
    Graphs and Combinatorics, 2021, 37 : 435 - 444
  • [43] Conditional independence collapsibility for acyclic directed mixed graph models
    Li, Weihua
    Sun, Yi
    Heng, Pei
    INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2024, 170
  • [44] Optimization of eigenvalue bounds for the independence and chromatic number of graph powers
    Abiad, A.
    Coutinho, G.
    Fiol, M. A.
    Nogueira, B. D.
    Zeijlemaker, S.
    DISCRETE MATHEMATICS, 2022, 345 (03)
  • [45] Bounds on the k-independence and k-chromatic numbers of graphs
    Blidia, Mostafa
    Bouchou, Ahmed
    Volkmann, Lutz
    ARS COMBINATORIA, 2014, 113 : 33 - 46
  • [46] Characteristic-independence of Betti numbers of graph ideals
    Katzman, M
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 2006, 113 (03) : 435 - 454
  • [47] The Shannon capacity of a graph and the independence numbers of its powers
    Alon, N
    Lubetzky, E
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (05) : 2172 - 2176
  • [48] Independence Numbers of Random Subgraphs of Some Distance Graph
    N. M. Derevyanko
    S. G. Kiselev
    Problems of Information Transmission, 2017, 53 : 307 - 318
  • [49] ON LINE INDEPENDENCE, DOMINATION, IRREDUNDANCE AND NEIGHBORHOOD NUMBERS OF A GRAPH
    KALE, PP
    DESHPANDE, NV
    INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS, 1990, 21 (08): : 695 - 698
  • [50] Independence Numbers of Random Subgraphs of Some Distance Graph
    Derevyanko, N. M.
    Kiselev, S. G.
    PROBLEMS OF INFORMATION TRANSMISSION, 2017, 53 (04) : 307 - 318