Approximating the maximum 3-edge-colorable subgraph problem (Q1043590): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: An Improved Approximation Algorithm for Maximum Edge 2-Coloring in Simple Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A matching problem with side conditions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4411281 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The NP-Completeness of Edge-Coloring / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: NP completeness of finding the chromatic index of regular graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A constructive proof of Vizing's theorem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2921756 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank | |||
Normal rank |
Latest revision as of 07:15, 2 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Approximating the maximum 3-edge-colorable subgraph problem |
scientific article |
Statements
Approximating the maximum 3-edge-colorable subgraph problem (English)
0 references
9 December 2009
0 references
approximation algorithm
0 references
edge-coloring
0 references
3-edge-coloring
0 references
Petersen graph
0 references
odd girth
0 references