Partitioning a Planar Graph of Girth 10 into a Forest and a Matching (Q3553247): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q60060264 / 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.1111/j.1467-9590.2009.00468.x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2064930463 / 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: Decomposing a planar graph with girth 9 into a forest and a matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax degrees of quasiplanar graphs with no short cycles other than triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax degrees of quasiplane graphs without 4-faces / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:04, 2 July 2024

scientific article
Language Label Description Also known as
English
Partitioning a Planar Graph of Girth 10 into a Forest and a Matching
scientific article

    Statements

    Partitioning a Planar Graph of Girth 10 into a Forest and a Matching (English)
    0 references
    22 April 2010
    0 references
    planar graph
    0 references
    girth
    0 references
    edge partition
    0 references
    forest matching
    0 references

    Identifiers