scientific article; zbMATH DE number 6125173
From MaRDI portal
Publication:4900286
zbMATH Open1265.05486MaRDI QIDQ4900286FDOQ4900286
Authors: I. G. Dmitriev, Oleg V. Borodin, Anna O. Ivanova 
Publication date: 14 January 2013
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 4101213
- An \((F_3,F_5)\)-partition of planar graphs with girth at least 5
- On partitioning the edges of 1-plane graphs
- scientific article; zbMATH DE number 1882351
- Note on partitions of planar graphs
- On uniquely partitionable planar graphs
- On the sizes of bipartite 1-planar graphs
- Remarks on the existence of uniquely partitionable planar graphs
- New results on edge partitions of 1-plane graphs
- Partitioning planar graphs with girth at least 6 into bounded size components
Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (9)
- Partition of a planar graph with girth 7 into two star forests
- Note on partitions of planar graphs
- Partitioning sparse plane graphs into two induced subgraphs of small degree
- Title not available (Why is that?)
- On the vertex partition of planar graphs into forests with bounded degree
- Path partitions of planar graphs
- Partitioning planar graphs with girth at least 6 into bounded size components
- Partition of a planar graph with girth 6 into two forests with chain length at most 4
- Path partition of planar graphs with girth at least six
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4900286)
