Lucky labelings of graphs (Q989579): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Vertex colouring edge partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree constrained subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Nullstellensatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular subgraphs of almost regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colorings and orientations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weight choosability of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On acyclic colorings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval bigraphs and circular arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge weights and vertex colours / rank
 
Normal rank
Property / cites work
 
Property / cites work: 1,2 conjecture-the multiplicative version / rank
 
Normal rank

Revision as of 02:21, 3 July 2024

scientific article
Language Label Description Also known as
English
Lucky labelings of graphs
scientific article

    Statements

    Lucky labelings of graphs (English)
    0 references
    0 references
    0 references
    0 references
    20 August 2010
    0 references
    combinatorial problems
    0 references
    lucky labeling
    0 references
    combinatorial nullstellensatz
    0 references

    Identifiers