Loading…
Loading…
Loading…
A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs
Golovach, Petr A., Johnson, Matthew, Paulusma, Daniël, Song, Jian
Published in Journal of graph theory (01.04.2017)
Published in Journal of graph theory (01.04.2017)
Get full text
Journal Article
Loading…
Loading…
Loading…
Loading…
Loading…
Loading…
Loading…
Loading…
Antimagic Labeling of Regular Graphs
Chang, Feihuang, Liang, Yu-Chang, Pan, Zhishi, Zhu, Xuding
Published in Journal of graph theory (01.08.2016)
Published in Journal of graph theory (01.08.2016)
Get full text
Journal Article
Loading…
Loading…
A Grid Theorem for Strong Immersions of Walls
Diestel, Reinhard, Jacobs, Raphael W., Knappe, Paul, Wollan, Paul
Published in Journal of graph theory (01.09.2025)
Published in Journal of graph theory (01.09.2025)
Get full text
Journal Article
Loading…
Loading…
Coloring graphs with no induced five‐vertex path or gem
Chudnovsky, Maria, Karthick, T., Maceli, Peter, Maffray, Frédéric
Published in Journal of graph theory (01.12.2020)
Published in Journal of graph theory (01.12.2020)
Get full text
Journal Article
Loading…
Loading…
Loading…
Loading…
Loading…
4‐Connected 1‐Planar Chordal Graphs Are Hamiltonian‐Connected
Zhang, Licheng, Huang, Yuanqiu, Lv, Shengxiang, Dong, Fengming
Published in Journal of graph theory (01.09.2025)
Published in Journal of graph theory (01.09.2025)
Get full text
Journal Article