X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
mathematics, applied (2) 2
2-connected graph (1) 1
complexity (1) 1
computational complexity (1) 1
hardness (1) 1
mathematics (1) 1
mechanical properties (1) 1
minimally total rainbow k-connected graph (1) 1
np-complete (1) 1
number (1) 1
numbers (1) 1
total rainbow coloring (1) 1
total rainbow connection number (1) 1
total-rainbow coloring (1) 1
total-rainbow k-connected (1) 1
total-rainbow k-connection number (1) 1
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Applied Mathematics and Computation, ISSN 0096-3003, 10/2017, Volume 311, pp. 223 - 227
.... A graph G is total rainbow k-connected if there is a total-coloring of G with k colors such that G is total rainbow connected... 
Total rainbow coloring | Total rainbow connection number | Minimally total rainbow k-connected graph | MATHEMATICS, APPLIED | NUMBERS | COMPLEXITY
Journal Article
by Liu, SJ and Liu, YL and Xing, HM and An, MQ and Li, J
ARS COMBINATORIA, ISSN 0381-7032, 01/2019, Volume 143, pp. 237 - 246
.... The total-colored graph G is total-rainbow k-connected if any two vertices of G are connected by k disjoint total-rainbow paths... 
2-connected graph | MATHEMATICS | NUMBER | total-rainbow coloring | total-rainbow k-connected
Journal Article
Applied Mathematics and Computation, ISSN 0096-3003, 07/2017, Volume 305, pp. 27 - 31
.... For a positive integer k, a total-colored graph is called total-rainbow k-connected if for every two vertices of G there are k internally disjoint total-rainbow paths in G connecting them. For an... 
Computational complexity | Total-rainbow k-connection number | NP-complete | MATHEMATICS, APPLIED | Mechanical properties | Hardness
Journal Article
No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.