Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture (Q526243): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q123136090 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2107648567 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1510.07017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On edge-colorings of graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of matching theory of edge-colourings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On disjoint matchings in cubic graphs: maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3680833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof for a generalization of Vizing's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing Triangles in Weighted Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-domination and \(k\)-independence in graphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating maximum edge 2-coloring in simple graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conjecture of Fink and Jacobson concerning k-domination and k- dependence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3691778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3691779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A stability theorem on fractional covering of triangles by edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing and covering triangles in \(K_{4}\)-free planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing and covering triangles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer and fractional packings in dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the maximum 2- and 3-edge-colorable subgraph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new tool for proving Vizing's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conjecture of Tuza about packing and covering of triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraphs with prescribed valencies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3395507 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum Δ-edge-colorable subgraphs of class II graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5528475 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tuza's conjecture for graphs with maximum average degree less than 7 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the maximum 3-edge-colorable subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small edge sets meeting all triangles of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3118960 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A conjecture on triangles of graphs / rank
 
Normal rank

Latest revision as of 19:27, 13 July 2024

scientific article
Language Label Description Also known as
English
Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture
scientific article

    Statements

    Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture (English)
    0 references
    0 references
    10 May 2017
    0 references
    edge coloring
    0 references
    Vizing's theorem
    0 references
    Tuza's conjecture
    0 references
    \(k\)-edge-colorable subgraph
    0 references
    \(k\)-dependent set
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers