Imagen de Portada

$θ$-free matching covered graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Joshi, Rohinee, Raghul, Santhosh, Kothari, Nishad
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

Extremal minimal bipartite matching covered graphs
por: Mallik, Amit Kumar, et al.
Publicado: (2024)

Planar cycle-extendable graphs
por: Dalwadi, Aditya Y, et al.
Publicado: (2024)

$λ$-matchability in cubic graphs
por: Raghul, Santhosh, et al.
Publicado: (2025)

On covering cubic graphs with three perfect matchings
por: Máčajová, Edita, et al.
Publicado: (2025)

The average size of maximal matchings in graphs
por: Hertz, Alain, et al.
Publicado: (2022)

Beyond recognizing well-covered graphs
por: Feghali, Carl, et al.
Publicado: (2024)

On graphs coverable by chubby shortest paths
por: Hatzel, Meike, et al.
Publicado: (2025)

Clique-free t-matchings in degree-bounded graphs
por: Paluch, Katarzyna, et al.
Publicado: (2024)

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

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

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

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

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

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

Distance-based (and path-based) covering problems for graphs of given cyclomatic number
por: Chakraborty, Dibyayan, et al.
Publicado: (2025)

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

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

Secure domination in $P_5$-free graphs
por: Gupta, Uttam K., 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)

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

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

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

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

$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)

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

The red-blue-yellow matching problem
por: Aprile, Manuel, et al.
Publicado: (2026)

Satisfying sequences for rainbow partite matchings
por: Kupavskii, Andrey, et al.
Publicado: (2025)

Families without $s$-matchings: the other end
por: Kupavskii, Andrey, et al.
Publicado: (2026)

On the finiteness of $k$-vertex-critical $2P_2$-free graphs with forbidden induced squids or bulls
por: Adekanye, Melvin, et al.
Publicado: (2024)

Odd-Cycle-Packing-treewidth: On the Maximum Independent Set problem in odd-minor-free graph classes
por: Choi, Mujin, et al.
Publicado: (2025)

Non-dissective coverings by planks
por: Kupavskii, Andrey, et al.
Publicado: (2025)

Intersecting families with covering number $3$
por: Kupavskii, Andrey
Publicado: (2024)

Induced matching treewidth and tree-independence number, revisited
por: Alon, Noga, et al.
Publicado: (2025)

A hierarchy of edge-weight symmetries in perfect matchings
por: Bérczi, Kristóf, et al.
Publicado: (2026)

Computational complexity of covering regular trees
por: Bok, Jan, et al.
Publicado: (2025)

Facial diagrams and cycle double cover
por: Ghanbari, Babak, et al.
Publicado: (2026)

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)