Simpler multicoloring of triangle-free hexagonal graphs (Q658035): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Every planar map is four colorable. II: Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 1-Local 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633932 / 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: Corrigendum: Static frequency assignment in cellular networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The four-colour theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4431015 / 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 <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 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
Property / cites work
 
Property / cites work: 1-Local 17/12-Competitive Algorithm for Multicoloring Hexagonal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 1-local 7/5-competitive Algorithm for Multicoloring Hexagonal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 1-Local 33/24-Competitive Algorithm for Multicoloring Hexagonal Graphs / rank
 
Normal rank

Latest revision as of 20:30, 4 July 2024

scientific article
Language Label Description Also known as
English
Simpler multicoloring of triangle-free hexagonal graphs
scientific article

    Statements

    Simpler multicoloring of triangle-free hexagonal graphs (English)
    0 references
    0 references
    0 references
    0 references
    11 January 2012
    0 references
    Weighted clique number of a graph
    0 references

    Identifiers