Image de couverture de livre

Extremal 1-planar graphs without k-cliques

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Zhang, Licheng, Huang, Yuanqiu, Dong, Fengming
Format:	Preprint
Publié:	2026
Sujets:	Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

The maximum number of $k$-cliques of 7-connected 1-planar graphs
par: Huang, Yuanqiu, et autres
Publié: (2026)

4-connected 1-planar chordal graphs are Hamiltonian-connected
par: Zhang, Licheng, et autres
Publié: (2024)

The reducibility of optimal 1-planar graphs
par: Zhang, Licheng, et autres
Publié: (2022)

Determining the minimum size of maximal 1-plane graphs
par: Huang, Yuanqiu, et autres
Publié: (2025)

A note on optimal 2-planar graphs
par: Zhang, Licheng, et autres
Publié: (2025)

Two classes of connectivity-related non-Hamiltonian 1-planar perfect graphs
par: Zhang, Licheng, et autres
Publié: (2024)

Near-perfect matchings in highly connected 1-planar graphs with a local crossing constraint
par: Ouyang, Licheng Zhang Yuanqiu Huang Zhangdong
Publié: (2026)

The minimum crossing number and minimum size of maximal 1-plane graphs with given connectivity
par: Ouyang, Zhangdong, et autres
Publié: (2025)

A new infinite family of 4-regular crossing-critical graphs
par: Ding, Zongpeng, et autres
Publié: (2024)

Maximal 1-plane graphs with the maximum number of crossings
par: Ouyang, Zhangdong, et autres
Publié: (2025)

The sharp upper bounds on the maximum degree and vertex-connectivity of claw-free 1-planar graphs
par: Zhang, Licheng, et autres
Publié: (2025)

The minimum size of 2-connected chordal bipartite graphs
par: Zhang, Licheng, et autres
Publié: (2024)

The density of maximal IC-plane graphs and maximal NIC-plane graphs
par: Ding, Zongpeng, et autres
Publié: (2025)

Extremal number of cliques of given orders in graphs with a forbidden clique minor
par: Shi, Ruilin, et autres
Publié: (2024)

Extremal spectral results of planar graphs without $C_{l, l}$ or $\mathrm{Theta}$ graph
par: Zhang, HaoRan, et autres
Publié: (2024)

The minimum size of maximal bipartite IC-plane graphs with given connectivity
par: Wang, Guiping, et autres
Publié: (2025)

Packing independent cliques into planar graphs
par: Biró, Csaba, et autres
Publié: (2024)

Counting cliques without generalized theta graphs
par: Gao, Jun, et autres
Publié: (2023)

The generalized 4-connectivity of godan graphs
par: Wang, Jing, et autres
Publié: (2024)

Extremal results on $k$-stepwise irregular graphs
par: Alizadeh, Yaser, et autres
Publié: (2024)

Tight cuts in matching covered graphs
par: Lu, Fuliang, et autres
Publié: (2026)

Extremal problems for star forests and cliques
par: Lu, Yongchun, et autres
Publié: (2024)

Every 3-connected $\{K_{1,4},K_{1,4}+e\}$-free split graph of order at least 13 is Hamilton-connected
par: Tian, Tao, et autres
Publié: (2026)

On minimal k-factor-critical planar graphs
par: Li, Qiuli, et autres
Publié: (2025)

4‐Connected 1‐Planar Chordal Graphs Are Hamiltonian‐Connected
par: Licheng Zhang, et autres
Publié: (2025)

Large planar $(n,m)$-cliques
par: Bandopadhyay, Susobhan, et autres
Publié: (2024)

Extremal Peisert-type graphs without the strict-EKR property
par: Goryainov, Sergey, et autres
Publié: (2023)

A study on $T$-equivalent graphs
par: Dong, Fengming, et autres
Publié: (2025)

On the minimum degree of minimal $k$-$\{1,2\}$-factor critical $k$-planar graphs
par: Pereyra, Kevin
Publié: (2026)

Extremal oriented graphs avoiding 1-subdivision of an in-star
par: Huang, Zejun, et autres
Publié: (2024)

On $k$-planar Graphs without Short Cycles
par: Bekos, Michael A., et autres
Publié: (2024)

Reduced clique graphs: a correction to "Chordal graphs and their clique graphs"
par: Mayhew, Dillon, et autres
Publié: (2023)

Dense $2$-connected planar graphs and the planar Turán number of $2C_k$
par: Li, Ping
Publié: (2025)

Extremal graphs for disjoint union of vertex-critical graphs
par: Zhang, Wenqian
Publié: (2025)

Non-canonical maximum cliques without a design structure in the block graphs of 2-designs
par: Goryainov, Sergey, et autres
Publié: (2023)

On the $4$-clique cover number of graphs
par: Chen, Yihan, et autres
Publié: (2025)

On the clique covering numbers of Johnson graphs
par: Jørgensen, Søren Fuglede
Publié: (2025)

Packing edge disjoint cliques in graphs
par: Balogh, József, et autres
Publié: (2025)

Clique covers and decompositions of cliques of graphs
par: Balogh, József, et autres
Publié: (2024)

Antimagicness of graphs with a dominating clique
par: Beaudoire, Grégoire, et autres
Publié: (2025)