Pages that link to "Item:Q2312052"
From MaRDI portal
The following pages link to Erdős-Gallai-type results for total monochromatic connection of graphs (Q2312052):
Displayed 6 items.
- Fractional matching preclusion number of graphs (Q2078848) (← links)
- Monochromatic disconnection: Erdős-Gallai-type problems and product graphs (Q2168716) (← links)
- The \(g\)-component connectivity of graphs (Q2232610) (← links)
- Monochromatic \(k\)-edge-connection colorings of graphs (Q2280002) (← links)
- On the \(g\)-good-neighbor connectivity of graphs (Q2283037) (← links)
- Erdös-Gallai-type problems for distance-edge-monitoring numbers (Q6184335) (← links)