Pages that link to "Item:Q1941399"
From MaRDI portal
The following pages link to On minimally rainbow \(k\)-connected graphs (Q1941399):
Displayed 26 items.
- Rainbow connections for outerplanar graphs with diameter 2 and 3 (Q279540) (← links)
- The minimum size of \(k\)-rainbow connected graphs of given order (Q383755) (← links)
- A note on the minimum size of \(k\)-rainbow-connected graphs (Q397136) (← links)
- Tight upper bound of the rainbow vertex-connection number for 2-connected graphs (Q400500) (← links)
- Proper connection of graphs (Q442366) (← links)
- Rainbow connection in oriented graphs (Q477332) (← links)
- Erdős-Gallai-type results for colorful monochromatic connectivity of a graph (Q512870) (← links)
- The vertex-rainbow index of a graph (Q726646) (← links)
- Note on minimally \(d\)-rainbow connected graphs (Q742605) (← links)
- Strong rainbow connection in digraphs (Q1701123) (← links)
- Rainbow connection numbers of Cayley digraphs on abelian groups (Q1739982) (← links)
- On total rainbow \(k\)-connected graphs (Q1739988) (← links)
- Some extremal results on the colorful monochromatic vertex-connectivity of a graph (Q1752632) (← links)
- Rainbow connectivity of Moore cages of girth 6 (Q1801053) (← links)
- Some results on the 3-vertex-rainbow index of a graph (Q2021678) (← links)
- Fractional matching preclusion number of graphs (Q2078848) (← links)
- Some results on the total proper \(k\)-connection number (Q2135063) (← links)
- Some results on the 3-total-rainbow index (Q2141205) (← links)
- The vertex-rainbow connection number of some graph operations (Q2227111) (← links)
- The \(g\)-component connectivity of graphs (Q2232610) (← links)
- Total rainbow connection numbers of some special graphs (Q2279465) (← links)
- More on the minimum size of graphs with given rainbow index (Q2282475) (← links)
- On the \(g\)-good-neighbor connectivity of graphs (Q2283037) (← links)
- Note on the hardness of rainbow connections for planar and line graphs (Q2350709) (← links)
- Rainbow connection number and graph operations (Q2399294) (← links)
- Upper bounds of proper connection number of graphs (Q2410035) (← links)