A linear time algorithm for \(7\)-\([3]\)coloring triangle-free hexagonal graphs (Q436606): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q658034
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Petra Šparl / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2012.02.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2059278954 / 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: Finding a five bicolouring of a triangle-free subgraph of the triangular lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Online Frequency Assignment in Cellular Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Channel assignment and weighted coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Static frequency assignment in cellular networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simpler multicoloring of triangle-free hexagonal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-local <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mn>4</mml:mn><mml:mo stretchy="false">/</mml:mo><mml:mn>3</mml:mn></mml:math>-competitive algorithm for multicoloring hexagonal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-local 7/6-competitive algorithm for multicolouring a sub-class of hexagonal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A technique for multicoloring triangle-free hexagonal graphs / rank
 
Normal rank

Latest revision as of 11:37, 5 July 2024

scientific article
Language Label Description Also known as
English
A linear time algorithm for \(7\)-\([3]\)coloring triangle-free hexagonal graphs
scientific article

    Statements

    A linear time algorithm for \(7\)-\([3]\)coloring triangle-free hexagonal graphs (English)
    0 references
    0 references
    0 references
    0 references
    25 July 2012
    0 references
    graph algorithm
    0 references
    approximation algorithm
    0 references
    multicoloring
    0 references
    frequency planning
    0 references
    hexagonal graph
    0 references

    Identifiers