The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture (Q326818): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jctb.2016.06.010 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jctb.2016.06.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2489305169 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56926519 / rank
 
Normal rank
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: Claw‐decompositions and tutte‐orientations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5403005 / 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: Q5403011 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nowhere-zero 3-flows and modulo \(k\)-orientations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-Coloring Edge-Weighting of Bipartite Graphs with Two Edge Weights / 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: The Erdős-Pósa property for odd cycles in graphs of large connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-decompositions of highly connected graphs into paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weak 3-flow conjecture and the weak circular flow conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph factors modulo \(k\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Factors of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On vertex-coloring 13-edge-weighting / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JCTB.2016.06.010 / rank
 
Normal rank

Latest revision as of 14:27, 9 December 2024

scientific article
Language Label Description Also known as
English
The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture
scientific article

    Statements

    The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture (English)
    0 references
    0 references
    0 references
    0 references
    12 October 2016
    0 references
    factors modulo \(k\)
    0 references
    1-2-3-conjecture
    0 references

    Identifiers