Packing and covering odd cycles in cubic plane graphs with small faces (Q5920132): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56003535, #quickstatements; #temporary_batch_1711439739529
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1701.07748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4371290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5641735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum bipartite subgraphs of cubic triangle-free planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3484869 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3649823 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Odd Cycle Transversals and Independent Sets in Fullerene Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Maximum Cut of a Planar Graph in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent sets in triangle-free cubic planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-disjoint odd cycles in planar graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4360235 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mangoes and blueberries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Odd Cuts and Plane Multicommodity Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the max-cut problem for a planar, cubic, triangle-free graph, and the Chinese postman problem for a planar triangulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-and edge-deletion NP-complete problems / rank
 
Normal rank

Latest revision as of 13:23, 14 July 2024

scientific article; zbMATH DE number 6789099
Language Label Description Also known as
English
Packing and covering odd cycles in cubic plane graphs with small faces
scientific article; zbMATH DE number 6789099

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references