Every triangle-free induced subgraph of the triangular lattice is \((5m,2m)\)-choosable (Q2636827): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2013.09.028 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2010988265 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1110.2650 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Choosability and fractional chromatic numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: List edge and list total colourings of multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending the disjoint-representatives theorems of Hall, Halmos, and Vaughan to list-multicolorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3922703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hajós-like theorem for list coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on \((a:b)\)-choosability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Channel assignment and multicolouring of the induced subgraphs of the triangular lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Choosability of the square of planar subcubic graphs with large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a five bicolouring of a triangle-free subgraph of the triangular lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5387673 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Channel assignment and weighted coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A technique for multicoloring triangle-free hexagonal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic number of a graph of girth 5 on a fixed surface / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4888118 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Choosability of planar graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2013.09.028 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:31, 19 December 2024

scientific article
Language Label Description Also known as
English
Every triangle-free induced subgraph of the triangular lattice is \((5m,2m)\)-choosable
scientific article

    Statements

    Every triangle-free induced subgraph of the triangular lattice is \((5m,2m)\)-choosable (English)
    0 references
    0 references
    0 references
    0 references
    18 February 2014
    0 references
    radio channel assignment
    0 references
    triangular lattice
    0 references
    choosability
    0 references
    weighted graph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references