Imagen de Portada

On the finiteness of $k$-vertex-critical $2P_2$-free graphs with forbidden induced squids or bulls

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Adekanye, Melvin, Bury, Christopher, Cameron, Ben, Knodel, Thaler
Formato:	Preprint
Publicado:	2024
Materias:	Combinatorics Discrete Mathematics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Vertex-critical graphs in co-gem-free graphs
por: Beaton, Iain, et al.
Publicado: (2024)

Long induced paths in sparse graphs and graphs with forbidden patterns
por: Duron, Julien, et al.
Publicado: (2024)

List coloring ordered graphs with forbidden induced subgraphs
por: Piecyk, Marta, et al.
Publicado: (2025)

Vertex-critical graphs in subfamilies of $(P_4+\ell P_1)$-free graphs
por: Beaton, Iain, et al.
Publicado: (2026)

Edge densities of drawings of graphs with one forbidden cell
por: Hahn, Benedikt, et al.
Publicado: (2025)

Long induced paths and forbidden patterns: Polylogarithmic bounds
por: Duron, Julien, et al.
Publicado: (2024)

An optimal chromatic bound for ($P_2+P_3$, gem)-free graphs
por: Char, Arnab, et al.
Publicado: (2024)

Path eccentricity of $k$-AT-free graphs and application on graphs with the consecutive ones property
por: Bastide, Paul, et al.
Publicado: (2024)

The sandwich problem for odd-hole-free and even-hole-free graphs
por: Cameron, Kathie, et al.
Publicado: (2024)

($P_2+P_4$, $K_4-e$)-free graphs are nearly $ω$-colorable
por: Angeliya, C. U., et al.
Publicado: (2025)

Minimum number of arcs in $k$-critical digraphs with order at most $2k-1$
por: Picasarri-Arrieta, Lucas, et al.
Publicado: (2023)

Maximum list $r$-colorable induced subgraphs in $kP_3$-free graphs
por: Galby, Esther, et al.
Publicado: (2025)

Secure domination in $P_5$-free graphs
por: Gupta, Uttam K., et al.
Publicado: (2025)

Cops and robber in graphs with bounded vertex cover number
por: Bose, Prosenjit, et al.
Publicado: (2026)

$K_{2,3}$-induced minor-free graphs admit quasi-isometry with additive distortion to graphs of tree-width at most two
por: Chakraborty, Dibyayan
Publicado: (2025)

Packing chromatic critical graphs with radius at most 2
por: Gür, Aslıhan, et al.
Publicado: (2026)

Strengthening the Murty-Simon conjecture on diameter 2 critical graphs
por: Dailly, Antoine, et al.
Publicado: (2018)

On universal graphs for trees and treewidth $k$ graphs
por: Kaul, Neel, et al.
Publicado: (2025)

Tree-independence number of $P_5$-free graphs with no large bicliques
por: Blažej, Václav, et al.
Publicado: (2026)

Interval H-graphs : Recognition and forbidden obstructions
por: Müller, Haiko, et al.
Publicado: (2025)

The vertex-pancyclicity of the simplified shuffle-cube and the vertex-bipancyclicity of the balanced shuffle-cube
por: Liu, Yasong, et al.
Publicado: (2024)

EPPA numbers of graphs
por: Bradley-Williams, David, et al.
Publicado: (2023)

$θ$-free matching covered graphs
por: Joshi, Rohinee, et al.
Publicado: (2024)

Coloring bridge-free antiprismatic graphs
por: Robin, Cléophée, et al.
Publicado: (2024)

A Brooks-type theorem for the k-choosability of graphs with maximum local edge-connectivity k
por: Bastida, Sam, et al.
Publicado: (2026)

Hitting all longest paths in $H$-free graphs and $H$-graphs
por: de Lima, Paloma T., et al.
Publicado: (2025)

Nucleation-free independent graphs with implied nonedges
por: Cheng, Jialong, et al.
Publicado: (2025)

Independent sets and colorings of $K_{t,t,t}$-free graphs
por: Dhawan, Abhishek, et al.
Publicado: (2025)

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

Computing fixed point free automorphisms of graphs
por: Abiad, Aida, et al.
Publicado: (2026)

The strong chromatic index of $K_{t,t}$-free graphs
por: Bi, Richard, et al.
Publicado: (2026)

Perfect divisibility of some bull-free graphs and its application
por: Chen, Ran, et al.
Publicado: (2026)

Preparing graph states forbidding a vertex-minor
por: Davies, James, et al.
Publicado: (2025)

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

A polynomial bound on the pathwidth of graphs edge-coverable by $k$ shortest paths
por: Baste, Julien, et al.
Publicado: (2025)

Non-empty intersection of longest paths in $H$-free graphs
por: Long Jr., James A., et al.
Publicado: (2023)

Algorithmic methods of finite discrete structures. Topological graph drawing (part I)
por: Kurapov, Sergey, et al.
Publicado: (2024)

Algorithmic methods of finite discrete structures. Topological graph drawing (part II)
por: Kurapov, Sergey, et al.
Publicado: (2024)

Algorithmic methods of finite discrete structures. Topological graph drawing (part IV)
por: Kurapov, Sergey, et al.
Publicado: (2025)

A Caro-Wei bound for induced linear forests in graphs
por: Joret, Gwenaël, et al.
Publicado: (2024)