Odd clique minors and chromatic bounds of {3$K_1$, paraglider}-free graphs
Fuente:
arXiv
Saved in:
| Main Authors: | Ji, Yuqing, Wang, Yue, Yang, Yujun, Zhang, Xia |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Odd clique minors in graphs with independence number two
by: Ji, Yuqing, et al.
Published: (2025)
by: Ji, Yuqing, et al.
Published: (2025)
Balanced clique subdivisions and cycles lengths in $K_{s, t}$-free graphs
by: Hou, Jianfeng, et al.
Published: (2024)
by: Hou, Jianfeng, et al.
Published: (2024)
Extremal number of cliques of given orders in graphs with a forbidden clique minor
by: Shi, Ruilin, et al.
Published: (2024)
by: Shi, Ruilin, et al.
Published: (2024)
Odd and even cycle lengths, minimum degree and chromatic number in graphs
by: Wang, Xiaolin
Published: (2025)
by: Wang, Xiaolin
Published: (2025)
Maximum spread of $K_{s,t}$-minor-free graphs
by: Linz, William, et al.
Published: (2024)
by: Linz, William, et al.
Published: (2024)
Maximum spread of $K_r$-minor free graphs
by: Wang, Wenyan, et al.
Published: (2024)
by: Wang, Wenyan, et al.
Published: (2024)
The strong chromatic index of $K_{t,t}$-free graphs
by: Bi, Richard, et al.
Published: (2026)
by: Bi, Richard, et al.
Published: (2026)
A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number
by: Pilipczuk, Marcin, et al.
Published: (2023)
by: Pilipczuk, Marcin, et al.
Published: (2023)
An optimal chromatic bound for ($P_2+P_3$, gem)-free graphs
by: Char, Arnab, et al.
Published: (2024)
by: Char, Arnab, et al.
Published: (2024)
Quasi-transitive $K_\infty$-minor free graphs
by: Hamann, Matthias
Published: (2024)
by: Hamann, Matthias
Published: (2024)
Extremal triangle-free graphs with chromatic number at least four
by: Ren, Sijie, et al.
Published: (2024)
by: Ren, Sijie, et al.
Published: (2024)
Improved bounds on the zeros of the chromatic polynomial of graphs and claw-free graphs
by: Bencs, Ferenc, et al.
Published: (2025)
by: Bencs, Ferenc, et al.
Published: (2025)
On the chromatic number of random triangle-free graphs
by: Mizgerd, Clayton, et al.
Published: (2025)
by: Mizgerd, Clayton, et al.
Published: (2025)
The clique chromatic number of sparse random graphs
by: Fernandez V, Manuel, et al.
Published: (2024)
by: Fernandez V, Manuel, et al.
Published: (2024)
Sparse induced subgraphs in $P_7$-free graphs of bounded clique number
by: Chudnovsky, Maria, et al.
Published: (2024)
by: Chudnovsky, Maria, et al.
Published: (2024)
Odd-Cycle-Packing-treewidth: On the Maximum Independent Set problem in odd-minor-free graph classes
by: Choi, Mujin, et al.
Published: (2025)
by: Choi, Mujin, et al.
Published: (2025)
Truncated degree DP-colourability of $K_{2,4}$-minor free graphs
by: Lo, On-Hei Solomon, et al.
Published: (2023)
by: Lo, On-Hei Solomon, et al.
Published: (2023)
The optimal chromatic bound for even-hole-free graphs without induced seven-vertex paths
by: Huang, Shenwei, et al.
Published: (2026)
by: Huang, Shenwei, et al.
Published: (2026)
Conflict-free chromatic index of bipartite graphs
by: Jin, Yuxin, et al.
Published: (2026)
by: Jin, Yuxin, et al.
Published: (2026)
Subcubic $K_4$-minor-free graphs without crumby colorings
by: Pintér, József
Published: (2026)
by: Pintér, József
Published: (2026)
New lower bounds on the non-repetitive chromatic number of some graphs
by: Tao, Tianyi, et al.
Published: (2025)
by: Tao, Tianyi, et al.
Published: (2025)
Eigenvalue bounds for the quantum chromatic number of graph powers
by: Abiad, Aida, et al.
Published: (2025)
by: Abiad, Aida, et al.
Published: (2025)
The oriented chromatic number of random graphs of bounded degree
by: Gunderson, Karen, et al.
Published: (2022)
by: Gunderson, Karen, et al.
Published: (2022)
On asymptotically tight bound for the conflict-free chromatic index of nearly regular graphs
by: Kamyczura, Mateusz, et al.
Published: (2024)
by: Kamyczura, Mateusz, et al.
Published: (2024)
Suns in triangle-free graphs of large chromatic number
by: Hajebi, Sepehr, et al.
Published: (2025)
by: Hajebi, Sepehr, et al.
Published: (2025)
A note on the maximum ratio between chromatic number and clique number
by: Araujo, Igor, et al.
Published: (2025)
by: Araujo, Igor, et al.
Published: (2025)
Topological cliques in sparse expanders
by: Wang, Xia, et al.
Published: (2024)
by: Wang, Xia, et al.
Published: (2024)
The clique number of the exact distance $t$-power graph: complexity and eigenvalue bounds
by: Abiad, Aida, et al.
Published: (2024)
by: Abiad, Aida, et al.
Published: (2024)
Nearly tight bound for rainbow clique subdivisions in properly edge-colored graphs and applications
by: Kuang, Peiru, et al.
Published: (2026)
by: Kuang, Peiru, et al.
Published: (2026)
On asymptotically tight bounds for the open conflict-free chromatic indexes of nearly regular graphs
by: Kamyczura, Mateusz, et al.
Published: (2026)
by: Kamyczura, Mateusz, et al.
Published: (2026)
A characterization of graphs with no $K_{3,4}$ minor
by: Lo, On-Hei Solomon
Published: (2026)
by: Lo, On-Hei Solomon
Published: (2026)
Induced subgraphs and tree decompositions XV. Even-hole-free graphs with bounded clique number have logarithmic treewidth
by: Chudnovsky, Maria, et al.
Published: (2024)
by: Chudnovsky, Maria, et al.
Published: (2024)
The strong chromatic index of 1-planar graphs
by: Wang, Yiqiao, et al.
Published: (2022)
by: Wang, Yiqiao, et al.
Published: (2022)
Extremal 1-planar graphs without k-cliques
by: Zhang, Licheng, et al.
Published: (2026)
by: Zhang, Licheng, et al.
Published: (2026)
Excluding a clique or a biclique in graphs of bounded induced matching treewidth
by: Abrishami, Tara, et al.
Published: (2024)
by: Abrishami, Tara, et al.
Published: (2024)
Odd complete bipartite minors in graphs with independence number two
by: Chen, Rong, et al.
Published: (2025)
by: Chen, Rong, et al.
Published: (2025)
Minimum saturated graphs for unions of cliques
by: Zhu, Wen-Han, et al.
Published: (2024)
by: Zhu, Wen-Han, et al.
Published: (2024)
On the mod $k$ chromatic index of graphs
by: Nweit, Oothan, et al.
Published: (2024)
by: Nweit, Oothan, et al.
Published: (2024)
On minimal free resolutions of the cover ideals of clique-whiskered graphs
by: Muta, Yuji, et al.
Published: (2025)
by: Muta, Yuji, et al.
Published: (2025)
Maximizing subgraph density in graphs of bounded degree and clique number
by: Kirsch, Rachel
Published: (2025)
by: Kirsch, Rachel
Published: (2025)
Similar Items
-
Odd clique minors in graphs with independence number two
by: Ji, Yuqing, et al.
Published: (2025) -
Balanced clique subdivisions and cycles lengths in $K_{s, t}$-free graphs
by: Hou, Jianfeng, et al.
Published: (2024) -
Extremal number of cliques of given orders in graphs with a forbidden clique minor
by: Shi, Ruilin, et al.
Published: (2024) -
Odd and even cycle lengths, minimum degree and chromatic number in graphs
by: Wang, Xiaolin
Published: (2025) -
Maximum spread of $K_{s,t}$-minor-free graphs
by: Linz, William, et al.
Published: (2024)