Thin trees in 8-edge-connected planar graphs (Q1711432): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2018.11.009 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2902703949 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5365094 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5417632 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bounded diameter arboricity / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Decomposing a graph into forests / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Decomposing a planar graph with girth at least 8 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 | |||
Latest revision as of 22:33, 17 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Thin trees in 8-edge-connected planar graphs |
scientific article |
Statements
Thin trees in 8-edge-connected planar graphs (English)
0 references
18 January 2019
0 references
planar graph
0 references
thin tree
0 references
algorithm
0 references
edge-coloring
0 references
decomposition
0 references
