On parsimonious edge-colouring of graphs with maximum degree three (Q2376086): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 0809.4747 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parsimonious edge coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Largest bipartite subgraphs in triangle-free graphs with maximum degree three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphes Cubiques D'Indice Chromatique Quatre / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3898517 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On parsimonious edge-colouring of graphs with maximum degree three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximumk-colorable subgraphs / 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: Classification and characterizations of snarks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measurements of edge-uncolorability / rank
 
Normal rank

Latest revision as of 14:36, 6 July 2024

scientific article
Language Label Description Also known as
English
On parsimonious edge-colouring of graphs with maximum degree three
scientific article

    Statements