Imagen de Portada

On complexity of substructure connectivity and restricted connectivity of graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Lü, Huazhong, Wu, Tingzeng
Formato:	Preprint
Publicado:	2021
Materias:	Computational Complexity Combinatorics 03D15, 05C40, 68R10
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A dichotomy theorem for $Γ$-switchable $H$-colouring on $m$-edge coloured graphs
por: Brewster, Richard, et al.
Publicado: (2023)

Results on three problems on isolation of graphs
por: Borg, Peter, et al.
Publicado: (2026)

Complexity of chess domination problems
por: Langlois-Rémillard, Alexis, et al.
Publicado: (2022)

Exploring P versus NP
por: Tang, Jian-Gang
Publicado: (2022)

Stretching Demi-Bits and Nondeterministic-Secure Pseudorandomness
por: Tzameret, Iddo, et al.
Publicado: (2023)

The maximum number of connected sets in regular graphs
por: Cambie, Stijn, et al.
Publicado: (2023)

Equivalences of promise compactness principles
por: Bodor, Bertalan
Publicado: (2026)

Paired many-to-many 2-disjoint path cover of Johnson graphs
por: Liu, Jinhao, et al.
Publicado: (2025)

Rainbow connectivity of multilayered random geometric graphs
por: Díaz, Josep, et al.
Publicado: (2024)

Degree-preserving graph dynamics -- a versatile process to construct random networks
por: Erdős, Péter L., et al.
Publicado: (2021)

A Linear Kernel for Independent Set Reconfiguration in Planar Graphs
por: Bousquet, Nicolas, et al.
Publicado: (2025)

Visualizing Geophylogenies -- Internal and External Labeling with Phylogenetic Tree Constraints
por: Klawitter, Jonathan, et al.
Publicado: (2023)

Infinite Eulerian paths are computable on graphs with vertices of infinite degree
por: Carrasco-Vargas, Nicanor
Publicado: (2023)

Minimal obstructions to $C_5$-coloring in hereditary graph classes
por: Goedgebeur, Jan, et al.
Publicado: (2024)

On dispersability of some circulant graphs
por: Kainen, Paul C., et al.
Publicado: (2021)

Small palindromic lengths in free groups and word equations with antimorphisms
por: Frid, Anna E.
Publicado: (2025)

Paths, Ends and The Separation Problem for Infinite Graphs
por: Carrasco-Vargas, Nicanor, et al.
Publicado: (2024)

Three-edge-coloring (Tait coloring) cubic graphs on the torus: A proof of Grünbaum's conjecture
por: Inoue, Yuta, et al.
Publicado: (2025)

Three-edge-coloring projective planar cubic graphs: A generalization of the Four Color Theorem
por: Inoue, Yuta, et al.
Publicado: (2024)

Three results towards the approximation of special maximum matchings in graphs
por: Mkrtchyan, Vahan
Publicado: (2024)

Zero blocking numbers of graphs with complexity results
por: Lin, Hau-Yi, et al.
Publicado: (2025)

Symmetric properties and two variants of shuffle-cubes
por: Lü, Huazhong, et al.
Publicado: (2021)

Conformal Hypergraphs: Duality and Implications for the Upper Clique Transversal Problem
por: Boros, Endre, et al.
Publicado: (2023)

Graph theoretic and algorithmic aspect of the equitable coloring problem in block graphs
por: Furmańczyk, Hanna, et al.
Publicado: (2020)

Canonical graph decompositions via local separations
por: Jacobs, Raphael W., et al.
Publicado: (2025)

The proper conflict-free $k$-coloring problem and the odd $k$-coloring problem are NP-complete on bipartite graphs
por: Ahn, Jungho, et al.
Publicado: (2022)

Dirac's theorem and the switch geometry of perfect matchings
por: Kang, Ross J., et al.
Publicado: (2026)

Towards Characterization of 5-List-Colorability of Toroidal Graphs
por: Dvořák, Zdeněk, et al.
Publicado: (2024)

The unavoidable drawings of complete multipartite graphs
por: Balogh, Jozsef, et al.
Publicado: (2025)

VC-dimension of subsets of Hamming graphs
por: Housholder, Christopher, et al.
Publicado: (2025)

Computability of Classification and Deep Learning: From Theoretical Limits to Practical Feasibility through Quantization
por: Boche, Holger, et al.
Publicado: (2024)

Circular-arc H-graphs: Ordering Characterizations and Forbidden Patterns
por: Paul, Indrajit, et al.
Publicado: (2025)

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought?
por: Bannach, Max, et al.
Publicado: (2025)

Extremal Results on Conflict-free Coloring
por: Bhyravarapu, Sriram, et al.
Publicado: (2023)

Evolomino is NP-complete
por: Nikolaev, Andrei V.
Publicado: (2025)

Monochromatic 4-AP avoidance in 2-colorings of Z/pZ for primes p >= 5 and a computation of W_c(4,2)
por: Irawan, Keane Maverick
Publicado: (2025)

An NP-hardness result for the colored constrained maximum 2-edge-colorable subgraph problem in bipartite graphs
por: Mkrtchyan, Vahan
Publicado: (2024)

The zero blocking numbers of generalized Kneser graphs and generalized Johnson graphs
por: Lin, Hau-Yi, et al.
Publicado: (2025)

The vertex Folkman number $F_v(3,3;5)$ equals~$8$
por: Niu, Tong
Publicado: (2026)

$2$-polarity and algorithmic aspects of polarity variants on cograph superclasses
por: Contreras-Mendoza, Fernando Esteban, et al.
Publicado: (2022)