A note on orientation and chromatic number of graphs

被引:0
|
作者
Manouchehr Zaker
机构
[1] Institute for Advanced Studies in Basic Sciences,Department of Mathematics
来源
关键词
Graph coloring; Chromatic number; Acyclic orientation; Degenerate subgraph; 05C15; 05C20;
D O I
暂无
中图分类号
学科分类号
摘要
Let D be any edge orientation of a graph G. We denote by Δk(D)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Delta _k(D)$$\end{document} the maximum value t for which there exists a directed path v1,…,vk\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$v_1, \ldots , v_k$$\end{document} such that dout(vk)=t\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$d^{out}(v_k)=t$$\end{document}, where dout(vk)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$d^{out}(v_k)$$\end{document} is the out-degree of vk\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$v_k$$\end{document} in D. We first obtain some bounds for the chromatic number of G in terms of Δk(D)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Delta _k(D)$$\end{document} and then show a relationship between Δk(D)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Delta _k(D)$$\end{document} and vertex partitions of a graph into degenerate subgraphs.
引用
收藏
页码:605 / 611
页数:6
相关论文
共 50 条
  • [21] On the difference between chromatic number and dynamic chromatic number of graphs
    Ahadi, A.
    Akbari, S.
    Dehghan, A.
    Ghanbari, M.
    DISCRETE MATHEMATICS, 2012, 312 (17) : 2579 - 2583
  • [22] A NOTE ON CHROMATIC UNIQUENESS OF GRAPHS
    CHIA, GL
    JOURNAL OF GRAPH THEORY, 1986, 10 (04) : 541 - 543
  • [23] A note on uncountably chromatic graphs
    Bowler, Nathan
    Pitz, Max
    ELECTRONIC JOURNAL OF COMBINATORICS, 2025, 32 (01):
  • [24] On incompactness for chromatic number of graphs
    Shelah, S.
    ACTA MATHEMATICA HUNGARICA, 2013, 139 (04) : 363 - 371
  • [25] On group chromatic number of graphs
    Lai, HJ
    Li, XW
    GRAPHS AND COMBINATORICS, 2005, 21 (04) : 469 - 474
  • [26] Hat chromatic number of graphs
    Bosek, Bartlomiej
    Dudek, Andrzej
    Farnik, Michal
    Grytczuk, Jaroslaw
    Mazur, Przemyslaw
    DISCRETE MATHEMATICS, 2021, 344 (12)
  • [27] On the chromatic number of Toeplitz graphs
    Nicoloso, Sara
    Pietropaoli, Ugo
    DISCRETE APPLIED MATHEMATICS, 2014, 164 : 286 - 296
  • [28] MONOTONE CHROMATIC NUMBER OF GRAPHS
    Saleh, Anwar
    Muthana, Najat
    Al-Shammakh, Wafa
    Alashwali, Hanaa
    INTERNATIONAL JOURNAL OF ANALYSIS AND APPLICATIONS, 2020, 18 (06): : 1108 - 1122
  • [29] On Indicated Chromatic Number of Graphs
    S. Francis Raj
    R. Pandiya Raj
    H. P. Patil
    Graphs and Combinatorics, 2017, 33 : 203 - 219
  • [30] Chromatic number and subtrees of graphs
    Baogang Xu
    Yingli Zhang
    Frontiers of Mathematics in China, 2017, 12 : 441 - 457