Covering planar graphs with forests, one having bounded maximum degree (Q1003834): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q60060261, #quickstatements; #temporary_batch_1712260040974
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Covering planar graphs with forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning a Planar Graph of Girth 10 into a Forest and a Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing a planar graph with girth 9 into a forest and a matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Caterpillar arboricity of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-partitions of planar graphs and their game coloring numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the invariance of Colin de Verdière's graph parameter under clique sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Finite Graphs Into Forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Problem of Decomposing a Graph into <i>n</i> Connected Factors / rank
 
Normal rank

Revision as of 02:39, 29 June 2024

scientific article
Language Label Description Also known as
English
Covering planar graphs with forests, one having bounded maximum degree
scientific article

    Statements

    Identifiers