Copertina

Large planar $(n,m)$-cliques

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Bandopadhyay, Susobhan, Sen, Sagnik, Taruni, S
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Combinatorics Discrete Mathematics
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Homomorphisms of (n,m)-graphs with respect to generalised switch
di: Sen, Sagnik, et al.
Pubblicazione: (2022)

On $(n,m)$-chromatic numbers of graphs having bounded sparsity parameters
di: Das, Sandip, et al.
Pubblicazione: (2023)

Bounds and extremal graphs for monitoring edge-geodetic sets in graphs
di: Foucaud, Florent, et al.
Pubblicazione: (2024)

Winding number and circular 4-coloring of signed graphs
di: Gujgiczer, Anna, et al.
Pubblicazione: (2023)

Algorithms and complexity for monitoring edge-geodetic sets in graphs
di: Foucaud, Florent, et al.
Pubblicazione: (2024)

Computing the clique number of tournaments
di: Aubian, Guillaume
Pubblicazione: (2024)

On arc-density of pushably $3$-critical oriented graphs
di: Das, Tapas, et al.
Pubblicazione: (2025)

Counting the minimum number of arcs in an oriented graph having weak diameter 2
di: Das, Sandip, et al.
Pubblicazione: (2023)

On locating and neighbor-locating colorings of sparse graphs
di: Chakraborty, Dipayan, et al.
Pubblicazione: (2023)

On graphs with a simple structure of maximal cliques
di: Gollin, J. Pascal, et al.
Pubblicazione: (2025)

A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number
di: Pilipczuk, Marcin, et al.
Pubblicazione: (2023)

On the existence of $δ$-temporal cliques in random simple temporal graphs
di: Mertzios, George B., et al.
Pubblicazione: (2024)

Immersions of large cliques in graphs with independence number 2 and bounded maximum degree
di: Botler, Fábio, et al.
Pubblicazione: (2025)

Expansion of gap-planar graphs
di: Wood, David R.
Pubblicazione: (2025)

Neighborhood complexity of planar graphs
di: Joret, Gwenaël, et al.
Pubblicazione: (2023)

On $k$-planar Graphs without Short Cycles
di: Bekos, Michael A., et al.
Pubblicazione: (2024)

Proper conflict-free choosability of planar graphs
di: Wang, Yuting, et al.
Pubblicazione: (2025)

Elimination distance to bounded degree on planar graphs
di: Lindermayr, Alexander, et al.
Pubblicazione: (2020)

2-distance 4-coloring of planar subcubic graphs with girth at least 21
di: La, Hoang, et al.
Pubblicazione: (2021)

Largest planar graphs of diameter $3$ and fixed maximum degree -- connection with fractional matchings
di: Dailly, Antoine, et al.
Pubblicazione: (2025)

3-colorable planar graphs have an intersection segment representation using 3 slopes
di: Gonçalves, Daniel
Pubblicazione: (2025)

Algorithmic methods of finite discrete structures. Graph clique problem
di: Kurapov, Sergey, et al.
Pubblicazione: (2024)

Trees and co-trees in planar 3-connected graphs An easier proof via Schnyder woods
di: Ortlieb, Christian, et al.
Pubblicazione: (2024)

On the clique number of random Cayley graphs and related topics
di: Conlon, David, et al.
Pubblicazione: (2024)

Substitution discrete plane tilings with $2n$-fold rotational symmetry for odd n
di: Kari, Jarkko, et al.
Pubblicazione: (2020)

Fortuitous sequences of flips of the top of a stack of n burnt pancakes for all n>24
di: Pierre, Laurent
Pubblicazione: (2016)

Hereditary Graph Product Structure and $\cal H$-clique-width
di: Hliněný, Petr, et al.
Pubblicazione: (2024)

On the Polynomial Kernelizations of Finding a Shortest Path with Positive Disjunctive Constraints
di: Bandopadhyay, Susobhan, et al.
Pubblicazione: (2023)

The Graph Coloring Game on $4\times n$-Grids
di: Brosse, Caroline, et al.
Pubblicazione: (2024)

The exact value of $c_1(K_{2,n})$
di: Mori, Hiroaki
Pubblicazione: (2026)

Critical Thresholds for Maximum Cardinality Matching on General Hypergraphs
di: Sumnicht, Christopher, et al.
Pubblicazione: (2024)

A composition theory for upward planar orders
di: Dong, Xue, et al.
Pubblicazione: (2025)

Moderately beyond clique-width: reduced component max-leaf and related parameters
di: Bonnet, Édouard, et al.
Pubblicazione: (2026)

Sensitivity of $m$-ary functions and low degree partitions of Hamming graphs
di: Asensio, Sara, et al.
Pubblicazione: (2024)

Effective Bounds for Restricted $3$-Arithmetic Progressions in $\mathbb{F}_p^n$
di: Bhangale, Amey, et al.
Pubblicazione: (2023)

A complete solution of the Erdős-Kleitman matching problem for $n\le 3s$
di: Kupavskii, Andrey, et al.
Pubblicazione: (2025)

Building Hamiltonian Cycles in the Semi-Random Graph Process in Less Than $2n$ Rounds
di: Frieze, Alan, et al.
Pubblicazione: (2023)

Planar Rosa : a family of quasiperiodic substitution discrete plane tilings with $2n$-fold rotational symmetry
di: Kari, Jarkko, et al.
Pubblicazione: (2022)

Characterizing Large Clique Number in Tournaments
di: Crew, Logan, et al.
Pubblicazione: (2026)

Every Poset has a Large Cut
di: Linial, Nati, et al.
Pubblicazione: (2025)