The Colouring Number of Infinite Graphs

被引：0
|
作者：
Nathan Bowler
Johannes Carmesin
Péter Komjáth
Christian Reiher
机构：
[1] Universität Hamburg,Fachbereich Mathematik
[2] University of Cambridge,Department of Pure Mathematics and Mathematical Statistics
[3] Eötvös Loránd University,undefined
来源：
Combinatorica | 2019年 / 39卷
关键词：
05C63; 05C75; 05C15; 03E05;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We show that, given an infinite cardinal μ, a graph has colouring number at most μ if and only if it contains neither of two types of subgraph. We also show that every graph with infinite colouring number has a well-ordering of its vertices that simultaneously witnesses its colouring number and its cardinality.
引用
收藏
页码：1225 / 1235
页数：10
相关论文
共 50 条
  • [1] The Colouring Number of Infinite Graphs
    Bowler, Nathan
    Carmesin, Johannes
    Komjath, Peter
    Reiher, Christian
    [J]. COMBINATORICA, 2019, 39 (06) : 1225 - 1235
  • [2] Colouring graphs with bounded generalized colouring number
    Zhu, Xuding
    [J]. DISCRETE MATHEMATICS, 2009, 309 (18) : 5562 - 5568
  • [3] On interval colouring reorientation number of oriented graphs
    Borowiecka-Olszewska, Marta
    Drgas-Burchardt, Ewa
    Zuazua, Rita
    [J]. DISCRETE APPLIED MATHEMATICS, 2025, 360 : 65 - 80
  • [4] The strong game colouring number of directed graphs
    Chan, Wai Hong
    Shiu, Wai Chee
    Sun, Pak Kiu
    Zhu, Xuding
    [J]. DISCRETE MATHEMATICS, 2013, 313 (10) : 1070 - 1077
  • [5] Colouring perfect graphs with bounded clique number
    Chudnovsky, Maria
    Lagoutte, Aurelie
    Seymour, Paul
    Spirkl, Sophie
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 2017, 122 : 757 - 775
  • [6] NOTE ON THE GAME COLOURING NUMBER OF POWERS OF GRAPHS
    Andres, Stephan Dominique
    Theuser, Andrea
    [J]. DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2016, 36 (01) : 31 - 42
  • [7] CORRECTION TO MY PAPER ON COLOURING OF INFINITE GRAPHS AND THEOREM OF KURATOWSKI
    MYCIELSKI, J
    [J]. ACTA MATHEMATICA ACADEMIAE SCIENTIARUM HUNGARICAE, 1967, 18 (3-4): : 339 - +
  • [8] An Efficient Colouring of Graphs Using Less Number of Colours
    Prajapati, Gend Lal
    Mittal, Amit
    Bhardwaj, Neha
    [J]. PROCEEDINGS OF THE 2012 WORLD CONGRESS ON INFORMATION AND COMMUNICATION TECHNOLOGIES, 2012, : 666 - 669
  • [9] On graphs double-critical with respect to the colouring number
    Kriesell, Matthias
    Pedersen, Anders Sune
    [J]. DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2015, 17 (02): : 49 - 62
  • [10] INFINITE GRAPHS WITH A SPECIFIED NUMBER OF COLORINGS
    HECHLER, SH
    [J]. DISCRETE MATHEMATICS, 1977, 19 (03) : 241 - 255
12345