Vertex-coloring 3-edge-weighting of some graphs (Q2374171): 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: Vertex-colouring edge-weightings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree constrained subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-coloring edge-weightings: towards the 1-2-3-conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge weights and vertex colours / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-coloring 2-edge-weighting of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Problem of Decomposing a Graph into <i>n</i> Connected Factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On vertex-coloring 13-edge-weighting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869540 / rank
 
Normal rank

Latest revision as of 02:50, 13 July 2024

scientific article
Language Label Description Also known as
English
Vertex-coloring 3-edge-weighting of some graphs
scientific article

    Statements

    Vertex-coloring 3-edge-weighting of some graphs (English)
    0 references
    0 references
    0 references
    0 references
    14 December 2016
    0 references
    1-2-3-conjecture
    0 references
    vertex-coloring 3-edge-weighting
    0 references
    spanning trees
    0 references

    Identifiers