Saved in:
| Main Authors: | Chang, Yeonsu, Ko, Sejin, Kwon, O-joung, Lee, Myounghwan |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2306.15206 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
A new width parameter of graphs based on edge cuts: $α$-edge-crossing width
by: Chang, Yeonsu, et al.
Published: (2023)
by: Chang, Yeonsu, et al.
Published: (2023)
Unavoidable butterfly minors in digraphs of large cycle rank
by: Hatzel, Meike, et al.
Published: (2025)
by: Hatzel, Meike, et al.
Published: (2025)
Moderately beyond clique-width: reduced component max-leaf and related parameters
by: Bonnet, Édouard, et al.
Published: (2026)
by: Bonnet, Édouard, et al.
Published: (2026)
Pre-assignment problem for unique minimum vertex cover on bounded clique-width graphs
by: An, Shinwoo, et al.
Published: (2024)
by: An, Shinwoo, et al.
Published: (2024)
Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k
by: Kanté, Mamadou Mostapha, et al.
Published: (2021)
by: Kanté, Mamadou Mostapha, et al.
Published: (2021)
Erdős-Pósa property of $A$-paths in unoriented group-labelled graphs
by: Kwon, O-joung, et al.
Published: (2024)
by: Kwon, O-joung, et al.
Published: (2024)
Reduced bandwidth: a qualitative strengthening of twin-width in minor-closed classes (and beyond)
by: Bonnet, Édouard, et al.
Published: (2022)
by: Bonnet, Édouard, et al.
Published: (2022)
Packing chromatic critical graphs with radius at most 2
by: Gür, Aslıhan, et al.
Published: (2026)
by: Gür, Aslıhan, et al.
Published: (2026)
An efficient algorithm for $\mathcal{F}$-subgraph-free Edge Deletion on graphs having a product structure
by: An, Shinwoo, et al.
Published: (2025)
by: An, Shinwoo, et al.
Published: (2025)
The spectral radius of $k$-chromatic $r$-graphs
by: Liu, Xizhi, et al.
Published: (2026)
by: Liu, Xizhi, et al.
Published: (2026)
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)
Unavoidable pivot-minors in graphs of large rank-depth
by: Ahn, Jungho, et al.
Published: (2025)
by: Ahn, Jungho, et al.
Published: (2025)
A half-integral Erdős-Pósa theorem for directed odd cycles
by: Kawarabayashi, Ken-ichi, et al.
Published: (2020)
by: Kawarabayashi, Ken-ichi, et al.
Published: (2020)
A characterization of graphs with at most four boundary vertices
by: Chiem, Nick, et al.
Published: (2022)
by: Chiem, Nick, et al.
Published: (2022)
Extremal distance spectral radius of graphs with $h$-extra $r$-component connectivity
by: Zhang, Daoxia, et al.
Published: (2025)
by: Zhang, Daoxia, et al.
Published: (2025)
The Erdős-Pósa property for circle graphs as vertex-minors
by: Campbell, Rutger, et al.
Published: (2025)
by: Campbell, Rutger, et al.
Published: (2025)
A unified Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups
by: Gollin, J. Pascal, et al.
Published: (2022)
by: Gollin, J. Pascal, et al.
Published: (2022)
A coarse Erdős-Pósa theorem
by: Ahn, Jungho, et al.
Published: (2024)
by: Ahn, Jungho, et al.
Published: (2024)
A unified half-integral Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups
by: Gollin, J. Pascal, et al.
Published: (2021)
by: Gollin, J. Pascal, et al.
Published: (2021)
The maximum spectral radius of planner graphs without the joint of K2 and a linear forest
by: Xu, Weilun, et al.
Published: (2024)
by: Xu, Weilun, et al.
Published: (2024)
Vertex ordering characterizations of interval r-graphs
by: Paul, Indrajit, et al.
Published: (2026)
by: Paul, Indrajit, et al.
Published: (2026)
Extremal spectral radius and $g$-good $r$-component connectivity
by: Ding, Wenxiu, et al.
Published: (2024)
by: Ding, Wenxiu, et al.
Published: (2024)
Essential connectivity and spectral radius of graphs
by: Ding, Wenxiu, et al.
Published: (2024)
by: Ding, Wenxiu, et al.
Published: (2024)
On the maximum spectral radius of planar graphs
by: Yu, Guanglong, et al.
Published: (2025)
by: Yu, Guanglong, et al.
Published: (2025)
The Origami flip graph of the $2\times n$ Miura-ori
by: Christensen, Lumi, et al.
Published: (2025)
by: Christensen, Lumi, et al.
Published: (2025)
Spectral radius and rainbow $k$-factors of graphs
by: Zhang, Liwen, et al.
Published: (2025)
by: Zhang, Liwen, et al.
Published: (2025)
Subdivision-free graphs with the maximum spectral radius
by: Sun, Wanting, et al.
Published: (2025)
by: Sun, Wanting, et al.
Published: (2025)
Cop-width, flip-width and strong colouring numbers
by: Hickingbotham, Robert
Published: (2023)
by: Hickingbotham, Robert
Published: (2023)
A characterization of extremal non-transmission-regular graphs by the distance (signless Laplacian) spectral radius
by: Lan, Jingfen, et al.
Published: (2024)
by: Lan, Jingfen, et al.
Published: (2024)
Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star
by: Dallard, Clément, et al.
Published: (2024)
by: Dallard, Clément, et al.
Published: (2024)
Symmetric and Kähler--Einstein Fano polygons
by: Hwang, DongSeon, et al.
Published: (2020)
by: Hwang, DongSeon, et al.
Published: (2020)
A Max-Min problem on spectral radius and connectedness of graphs
by: Lou, Zhenzhen, et al.
Published: (2025)
by: Lou, Zhenzhen, et al.
Published: (2025)
Chvátal-Erdős condition for 2-factors with at most two components in graphs
by: Tian, Tao, et al.
Published: (2026)
by: Tian, Tao, et al.
Published: (2026)
Some bounds on the spectral radius of connected threshold graphs
by: Csikvári, Péter, et al.
Published: (2024)
by: Csikvári, Péter, et al.
Published: (2024)
Extremal distance spectral radius of graphs with fixed size
by: Lin, Hongying, et al.
Published: (2025)
by: Lin, Hongying, et al.
Published: (2025)
Minimal spectral radius of graphs with given matching number
by: Liu, Jiaqi, et al.
Published: (2026)
by: Liu, Jiaqi, et al.
Published: (2026)
Spectral radius and edge-disjoint connected factors of graphs
by: Tang, Xinying, et al.
Published: (2026)
by: Tang, Xinying, et al.
Published: (2026)
Some lemmas on spectral radius of graphs: including an application
by: Zhang, Wenqian
Published: (2026)
by: Zhang, Wenqian
Published: (2026)
Spectral radius and parity $[a,b]$-factors in graphs
by: Liu, Ruifang, et al.
Published: (2026)
by: Liu, Ruifang, et al.
Published: (2026)
Toughness and Aα-spectral radius in graphs
by: Zhou, Sizhong, et al.
Published: (2024)
by: Zhou, Sizhong, et al.
Published: (2024)
Similar Items
-
A new width parameter of graphs based on edge cuts: $α$-edge-crossing width
by: Chang, Yeonsu, et al.
Published: (2023) -
Unavoidable butterfly minors in digraphs of large cycle rank
by: Hatzel, Meike, et al.
Published: (2025) -
Moderately beyond clique-width: reduced component max-leaf and related parameters
by: Bonnet, Édouard, et al.
Published: (2026) -
Pre-assignment problem for unique minimum vertex cover on bounded clique-width graphs
by: An, Shinwoo, et al.
Published: (2024) -
Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k
by: Kanté, Mamadou Mostapha, et al.
Published: (2021)