Result 1 to 20 of 29 total
Max-optimal and sum-optimal labelings of graphs. (English)
Inf. Process. Lett. 112, No. 1-2, 26-31 (2012).
1
Optimally routing data in fiber-optic networks with existing flow. (English)
Bull. Inst. Comb. Appl. 63, 111-119 (2011).
2
Rank numbers for some trees and unicyclic graphs. (English)
Aequationes Math. 82, No. 1-2, 65-79 (2011).
3
Intermediate minimal $k$-rankings of graphs. (English)
J. Comb. Math. Comb. Comput. 78, 341-348 (2011).
4
Representation numbers and Prague dimensions for complete graphs minus a disjoint union of paths. (English)
J. Comb. Math. Comb. Comput. 78, 97-110 (2011).
5
An optimal $k$-ranking characterization of oriented paths and cycles. (English)
Bull. Inst. Comb. Appl. 61, 97-108 (2011).
6
The birank number of a graph. (English)
Congr. Numerantium 204, 173-180 (2010).
7
Maximum flow in fiber-optic networks. (English)
Bull. Inst. Comb. Appl. 60, 91-96 (2010).
8
Minimal $k$-rankings for prism graphs. (English)
Involve 3, No. 2, 183-190 (2010).
9
Representations for complete graphs minus a disjoint union of paths. (English)
J. Comb. Math. Comb. Comput. 72, 173-180 (2010).
10
Greedy rankings and arank numbers. (English)
Inf. Process. Lett. 109, No. 15, 825-827 (2009).
11
Minimal $k$-rankings and the rank number of $P^2_n$. (English)
Inf. Process. Lett. 109, No. 3, 193-198 (2009).
12
Maximum minimal rankings of oriented trees. (English)
Involve 2, No. 3, 289-295 (2009).
13
Representations of graphs modulo $n$: some problems. (English)
Bull. Inst. Comb. Appl. 56, 85-97 (2009).
14
Powers of directed Hamiltonian paths as feedback arc sets. (English)
J. Comb. Math. Comb. Comput. 66, 257-272 (2008).
15
On the reversing number of powers of directed Hamiltonian paths. (English)
Util. Math. 73, 181-206 (2007).
16
Modern applications of graph theory. (English)
Congr. Numerantium 184, 145-159 (2007).
17
Representations of split graphs, their complements, stars, and hypercubes. (English)
Integers 7, No. 1, Paper A09, 13 p., electronic only (2007).
18
Minimal rankings and the arank number of a path. (English)
Discrete Math. 306, No. 16, 1991-1996 (2006).
19
A classification of tournaments having an acyclic tournament as a minimum feedback arc set. (English)
Inf. Process. Lett. 92, No. 3, 107-111 (2004).
20
Result 1 to 20 of 29 total
Start
Contact
Print
General Help
