Partitioning Planar Graphs Without Specific Cycles into a Forest and a Disjoint Union of Paths
In this paper, we show that if a planar graph <i>G</i> satisfies the following conditions: (i) none of its 3-faces is adjacent to a <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msup><mn>6&l...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-04-01
|
| Series: | Axioms |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2075-1680/14/4/293 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!