A (2, 1)-Decomposition of Planar Graphs Without Intersecting 3-Cycles and Adjacent 4--Cycles

Let G be a graph. For two positive integers d and h , a ( d ,  h )- decomposition of G is a pair ( G ,  H ) such that H is a subgraph of G of maximum degree at most h and D is an acyclic orientation of G - E ( H ) of maximum out-degree at most d . A graph G is ( d ,  h )- decomposable if G has a ( d...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Graphs and combinatorics 2023-12, Vol.39 (6), Article 115
Hauptverfasser:	Tian, Fangyu, Li, Xiangwen
Format:	Artikel
Sprache:	eng
Schlagworte:	Combinatorics Decomposition Engineering Design Graph theory Mathematics Mathematics and Statistics Original Paper
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!