Cover Image

Claw-free bricks that every $b$-invariant edge is solitary

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Zhang, Yipei, Wang, Xiumei
Format:	Preprint
Published:	2025
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Solid bricks that every $b$-invariant edge is solitary
by: Zhang, Yipei, et al.
Published: (2025)

A note on removable edges in near-bricks
by: Wu, Deyu, et al.
Published: (2023)

Removable edges in near-bipartite bricks
by: Zhang, Yipei, et al.
Published: (2024)

Cubic bricks that every b-invariant edge is forcing
by: Zhang, Yaxian, et al.
Published: (2024)

Claw-free minimal matching covered graphs
by: Zhang, Yipei, et al.
Published: (2024)

Removable edges in near‐bipartite bricks
by: Yipei Zhang, et al.
Published: (2024)

Claw-free cubic graphs are (1, 1, 1, 3)-packing edge-colorable
by: Hou, Jingxi, et al.
Published: (2025)

Spectral conditions for graphs in which every edge belongs to a factor
by: Cai, Jin, et al.
Published: (2024)

On essentially 4-edge-connected cubic bricks
by: Kothari, Nishad, et al.
Published: (2018)

Minimal Regular graphs with every edge in a triangle
by: Preen, James
Published: (2021)

Finding d-Cuts in Claw-free Graphs
by: Ahn, Jungho, et al.
Published: (2025)

Almost partitioning every $2$-edge-coloured complete $k$-graph into $k$ monochromatic tight cycles
by: Lo, Allan, et al.
Published: (2023)

(Claw, C_3)-free digraphs with unbounded dichromatic number
by: Aubian, Guillaume, et al.
Published: (2026)

Planar wheel-like bricks
by: Lu, Fuliang, et al.
Published: (2024)

The number of perfect matchings in a brick
by: Lu, Fuliang, et al.
Published: (2024)

Regular subgraphs at every density
by: Chakraborti, Debsoumya, et al.
Published: (2024)

Some Cases of the Erdős-Lovász Tihany Conjecture for Claw-free Graphs
by: Longbrake, Sean, et al.
Published: (2024)

Wheel-like bricks and minimal matching covered graphs
by: He, Xiaoling, et al.
Published: (2024)

Claw-free cubic graphs are $(1, 1, 2, 2)$-colorable
by: Brešar, Boštjan, et al.
Published: (2024)

Generating simple near-bipartite bricks
by: Kothari, Nishad, et al.
Published: (2017)

Hamiltonian Properties of 3-Connected Claw-Free Graphs and Line Graphs of 3-Hypergraphs
by: Ozeki, Kenta, et al.
Published: (2026)

Asymptotic invariants of symbolic powers of binomial edge ideals
by: Belotserkovskiy, Dennis, et al.
Published: (2025)

CLM's dependence relation, solitary patterns and $r$-graphs
by: Narayana, D. V. V., et al.
Published: (2024)

Almost every Latin square has a decomposition into transversals
by: Bowtell, Candida, et al.
Published: (2025)

On 2-bisections and monochromatic edges in claw-free cubic multigraphs
by: Romaniello, Federico
Published: (2023)

From brick manifolds to Grassmannians of bimodules
by: Feigin, Evgeny, et al.
Published: (2025)

A Characterization of Claw-Free Graphs using Zero Forcing Invariants
by: Davila, Randy, et al.
Published: (2024)

Injective edge-coloring of claw-free graphs with maximum degree 4
by: Huang, Danjun, et al.
Published: (2025)

The number of cut-edges and conflict-free connection number in planar graphs
by: Ha, Pham Hoang, et al.
Published: (2026)

The spectral radii and extremal graphs of two types of minimal graphs
by: Lian, Liwen, et al.
Published: (2025)

Orientations of graphs with at most one directed path between every pair of vertices
by: Dohnalová, Barbora, et al.
Published: (2024)

Partitions in which every term but the smallest one is consecutive
by: Gupta, Rajat, et al.
Published: (2024)

Same average in every direction
by: Bárány, Imre, et al.
Published: (2023)

On the complexity of edge subdivision to $H$-free graphs
by: Piecyk, Marta, et al.
Published: (2026)

The square of every subcubic planar graph without 4-cycles and 5-cycles is 7-choosable
by: Jin, Ligang, et al.
Published: (2025)

An explicit family of 30 blocks meeting every 6-set of [60] in at least two points
by: Gomes, Paulo Henrique Cunha
Published: (2026)

Almost all $C_k$-free oriented graphs have $Θ(n)$ backwards edges
by: Liu, Jianxi, et al.
Published: (2026)

Birkhoff-von Neumann Graphs that are PM-compact
by: de Carvalho, Marcelo H., et al.
Published: (2018)

A 910-block explicit construction guaranteeing a triple intersection with every $6$-subset of $[60]$
by: Gomes, Paulo Henrique Cunha
Published: (2026)

A 920-block explicit construction guaranteeing a triple intersection with every 6-subset of [60]
by: Gomes, Paulo Henrique Cunha
Published: (2026)