$(I,F)$-partition of planar graphs without cycles of length 4, 6, or 9
Saved in:
Main Authors: | Yingli Kang, Hongkai Lu, Ligang Jin |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Zielona Góra
2025-01-01
|
Series: | Discussiones Mathematicae Graph Theory |
Online Access: | https://www.dmgt.uz.zgora.pl/?doi=10.7151/dmgt.2523 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
List Edge Colorings of Planar Graphs without Adjacent 7-Cycles
by: Wenwen Zhang
Published: (2021-01-01) -
A Note on Edge-Group Choosability of Planar Graphs without 5-Cycles
by: Amir Khamseh
Published: (2020-01-01) -
DP-4-Colorability on Planar Graphs Excluding 7-Cycles Adjacent to 4- or 5-Cycles
by: Fan Yang, et al.
Published: (2025-01-01) -
Partition Dimension of Generalized Petersen Graph
by: Hassan Raza, et al.
Published: (2021-01-01) -
Zero-sum partition theorems for graphs
by: Y. Caro, et al.
Published: (1994-01-01)