Path partitioning planar graphs of girth 4 without adjacent short cycles (Q1615735)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Path partitioning planar graphs of girth 4 without adjacent short cycles |
scientific article; zbMATH DE number 6969400
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Path partitioning planar graphs of girth 4 without adjacent short cycles |
scientific article; zbMATH DE number 6969400 |
Statements
Path partitioning planar graphs of girth 4 without adjacent short cycles (English)
0 references
31 October 2018
0 references
planar graph
0 references
girth
0 references
triangle-free graph
0 references
path partition
0 references
\(\tau\)-partitionable graph
0 references
path partition conjecture
0 references
0 references
0.9149053
0 references
0.8910844
0 references
0 references
0.88668895
0 references
0.88658124
0 references
0.8805533
0 references
0 references
0.8758624
0 references
0 references
