On disjoint matchings in cubic graphs: maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs (Q2449123): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Vahan V. Mkrtchyan / rank
Normal rank
 
Property / author
 
Property / author: Vahan V. Mkrtchyan / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2014.03.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W61806522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The edge chromatic difference sequence of a cubic graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parsimonious edge coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Core of a Graph<sup>†</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On trees with a maximum proper partial 0-1 coloring containing a maximum matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on minimal matching covered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On edge-disjoint pairs of matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On disjoint matchings in cubic graphs / 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: Measurements of edge-uncolorability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of a class of graphs related to pairs of disjoint matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869540 / rank
 
Normal rank

Latest revision as of 12:27, 8 July 2024

scientific article
Language Label Description Also known as
English
On disjoint matchings in cubic graphs: maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs
scientific article

    Statements

    On disjoint matchings in cubic graphs: maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    6 May 2014
    0 references
    edge-coloring
    0 references
    cubic graph
    0 references
    maximum 2-edge-colorable subgraph
    0 references
    maximum 3-edge-colorable subgraph
    0 references

    Identifiers