Path partitioning planar graphs with restrictions on short cycles (Q2234425): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.33048/semi.2021.18.073 / rank
Normal rank
 
Property / author
 
Property / author: Alekseĭ Nikolaevich Glebov / rank
Normal rank
 
Property / author
 
Property / author: Alekseĭ Nikolaevich Glebov / 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.33048/semi.2021.18.073 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3211789736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 1-improper 2-coloring of sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A path(ological) partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partition problems and kernels of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path partitions and \(P_{n}\)-free sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4943521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The path partition conjecture is true for claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of the Path Partition Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splitting a planar graph of girth 5 into two forests with trees of small diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring planar graphs with bounded monochromatic components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path partitions of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path partitioning planar graphs of girth 4 without adjacent short cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of cycles of lengthk in a maximal planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improper coloring of sparse graphs with a given girth. I: \((0,1)\)-colorings of triangle-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3760581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on Planar Graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.33048/SEMI.2021.18.073 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:48, 17 December 2024

scientific article
Language Label Description Also known as
English
Path partitioning planar graphs with restrictions on short cycles
scientific article

    Statements

    Path partitioning planar graphs with restrictions on short cycles (English)
    0 references
    19 October 2021
    0 references
    planar graph
    0 references
    girth
    0 references
    path partition
    0 references
    \( \tau \)-partitionable graph
    0 references
    path partition conjecture
    0 references

    Identifiers

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