Result 1 to 14 of 14 total
The total detection numbers of graphs. (English)
J. Comb. Math. Comb. Comput. 81, 97-119 (2012).
1
On the hardness of recognizing triangular line graphs. (English)
Discrete Math. 312, No. 17, 2627-2638 (2012).
2
Geodetic domination in graphs. (English)
J. Comb. Math. Comb. Comput. 77, 89-101 (2011).
3
Triangular line graphs and word sense disambiguation. (English)
Discrete Appl. Math. 159, No. 11, 1160-1165 (2011).
4
Extremal problems on detectable colorings of trees. (English)
Discrete Math. 308, No. 10, 1951-1961 (2008).
5
A three-color problem in graph theory. (English)
Bull. Inst. Comb. Appl. 52, 65-82 (2008).
6
Vertex-distinguishing colorings of graphs a survey of recent developments. (English)
AKCE Int. J. Graphs Comb. 4, No. 3, 277-299 (2007).
7
On detectable factorizations of regular graphs. (English)
Congr. Numerantium 185, 173-184 (2007).
8
Circulants and a three-color conjecture. (English)
Congr. Numerantium 178, 33-55 (2006).
9
On detectable factorizations of cubic graphs. (English)
J. Comb. Math. Comb. Comput. 56, 47-63 (2006).
10
On detectable colorings of graphs. (English)
Math. Bohem. 130, No. 4, 427-445 (2005).
11
Extremal problems in detectable colorings of connected graphs with cycle rank 2. (English)
AKCE Int. J. Graphs Comb. 2, No. 2, 99-117 (2005).
12
Detour distance in graphs. (English)
J. Comb. Math. Comb. Comput. 53, 75-94 (2005).
13
Extremal problems on distances in graphs. (English)
Congr. Numerantium 167, 133-147 (2004).
14
Result 1 to 14 of 14 total
Start
Contact
Print
General Help
