Partitioning a triangle-free planar graph into a forest and a forest of bounded degree (Q5890907): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Merged Item from Q5920083
 
(6 intermediate revisions by 5 users not shown)
description / endescription / en
scientific article; zbMATH DE number 6639380
scientific article; zbMATH DE number 6773726
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1369.05169 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/j.ejc.2017.06.014 / rank
 
Normal rank
Property / author
 
Property / author: François Dross / rank
 
Normal rank
Property / published in
 
Property / published in: European Journal of Combinatorics / rank
 
Normal rank
Property / publication date
 
11 September 2017
Timestamp+2017-09-11T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 11 September 2017 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6773726 / rank
 
Normal rank
Property / zbMATH Keywords
 
\((\mathcal{F},\mathcal{F}_5)\)-partition
Property / zbMATH Keywords: \((\mathcal{F},\mathcal{F}_5)\)-partition / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2964100745 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2757851332 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1601.01523 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:18, 29 April 2024

scientific article; zbMATH DE number 6773726
Language Label Description Also known as
English
Partitioning a triangle-free planar graph into a forest and a forest of bounded degree
scientific article; zbMATH DE number 6773726

    Statements

    Partitioning a triangle-free planar graph into a forest and a forest of bounded degree (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    14 October 2016
    0 references
    11 September 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    triangle-free planar graph
    0 references
    vertex partition
    0 references
    forest
    0 references
    bounded degree
    0 references
    \((\mathcal{F},\mathcal{F}_5)\)-partition
    0 references
    0 references
    0 references
    0 references