Incidence coloring of mycielskians with fast algorithm (Q2043007): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The star arboricity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence and strong edge colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note of vertex arboricity of planar graphs without 4-cycles intersecting with 6-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elementary landscape decomposition of the frequency assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \((d, 1)\)-total labelling of Sierpiński-like graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On incidence coloring conjecture in Cartesian products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On incidence coloring and star arboricity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anti-\(k\)-labeling of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5387657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence coloring of \(k\)-degenerated graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The incidence coloring numbers of meshes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On incidence coloring of complete multipartite and semicubic bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence coloring -- cold cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence coloring of pseudo-Halin graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constructive proof of Vizing's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2912221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \((p, 1)\)-total labelling of some 1-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence coloring on hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On incidence coloring for some cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The incidence chromatic number of toroidal grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum scan statistics and channel assignment problems in homogeneous wireless networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: List \(r\)-dynamic coloring of sparse graphs / rank
 
Normal rank

Revision as of 05:57, 26 July 2024

scientific article
Language Label Description Also known as
English
Incidence coloring of mycielskians with fast algorithm
scientific article

    Statements

    Incidence coloring of mycielskians with fast algorithm (English)
    0 references
    0 references
    0 references
    22 July 2021
    0 references
    incidence coloring
    0 references
    Mycielskian
    0 references
    cubic-time algorithm
    0 references
    frequency assignment problem
    0 references

    Identifiers