Pages that link to "Item:Q300179"
From MaRDI portal
The following pages link to Note on the complexity of deciding the rainbow (vertex-) connectedness for bipartite graphs (Q300179):
Displaying 18 items.
- Hardness results for total rainbow connection of graphs (Q274688) (← links)
- Coupon coloring of some special graphs (Q512874) (← links)
- Further hardness results on rainbow and strong rainbow connectivity (Q908308) (← links)
- The generalized 3-connectivity of Cayley graphs on symmetric groups generated by trees and cycles (Q1684938) (← links)
- Rainbow vertex-connection and forbidden subgraphs (Q1692637) (← links)
- A result on the 3-generalized connectivity of a graph and its line graph (Q1714044) (← links)
- Note on the perfect EIC-graphs (Q1733665) (← links)
- The \(k\)-proper index of graphs (Q1734744) (← links)
- On tetravalent symmetric dihedrants (Q1735462) (← links)
- On total rainbow \(k\)-connected graphs (Q1739988) (← links)
- Rainbow connectivity and rainbow criticality on graph classes (Q2091815) (← links)
- A characterisation on arc-transitive graphs of prime valency (Q2279242) (← links)
- Graphs with small total rainbow connection number (Q2405975) (← links)
- On the complexity of \(k\)-rainbow cycle colouring problems (Q2422742) (← links)
- The complexity of determining the vertex-rainbow index of graphs (Q2788724) (← links)
- Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs (Q5005187) (← links)
- The strong 3-rainbow index of some certain graphs and its amalgamation (Q5089897) (← links)
- A survey on rainbow (vertex-)index of graphs (Q6130217) (← links)
