The following pages link to The integrity of a cubic graph (Q1827848):
Displaying 13 items.
- A feedback vertex set of 2-degenerate graphs (Q300250) (← links)
- Network majority on tree topological network (Q510545) (← links)
- On the range of possible integrities of graphs \(G(n, k)\) (Q659726) (← links)
- Regular honest graphs, isoperimetric numbers, and bisection of weighted graphs (Q1306928) (← links)
- Safe number and integrity of graphs (Q1671366) (← links)
- New lower bounds on the size-Ramsey number of a path (Q2073313) (← links)
- Feedback vertex sets in cubic multigraphs (Q2515555) (← links)
- Largest component and node fault tolerance for grids (Q2656897) (← links)
- (Q3614014) (← links)
- (Q5150664) (← links)
- A note on the integrity of grids (Q6069150) (← links)
- Spectral bounds for the vulnerability parameters of graphs (Q6125428) (← links)
- Strong blocking sets and minimal codes from expander graphs (Q6571606) (← links)