Result 1 to 20 of 34 total
On $k$-detour subgraphs of hypercubes. (English)
J. Graph Theory 57, No. 1, 55-64 (2008).
1
Bisecting a 4-connected graph with three resource sets. (English)
Discrete Appl. Math. 155, No. 11, 1441-1450 (2007).
2
Some efficient conditions for graphs to have $(g,f)$-factors. (English)
Bull. Aust. Math. Soc. 75, No. 3, 447-452 (2007).
3
A new generalization of Mantel’s theorem to $k$-graphs. (English)
J. Comb. Theory, Ser. B 97, No. 4, 669-678 (2007).
4
Amalgamations of factorizations of complete graphs. (English)
J. Comb. Theory, Ser. B 97, No. 4, 597-611 (2007).
5
Finite and infinite hypercubes as direct products. (English)
Australas. J. Comb. 36, 83-90 (2006).
6
Claw-decompositions and Tutte-orientations. (English)
J. Graph Theory 52, No. 2, 135-146 (2006).
7
Factors and vertex-deleted subgraphs. (English)
Discrete Math. 306, No. 6, 607-611 (2006).
8
On the construction of graphs with large numbers of spanning trees. (English)
Congr. Numerantium 172, 123-148 (2005).
9
Special heterogeneous decompositions into spanning trees. (English)
Bull. Inst. Comb. Appl. 43, 33-36 (2005).
10
Minimizing the number of partial matchings in bipartite graphs. (English)
Bull. Inst. Comb. Appl. 43, 13-18 (2005).
11
Upper bounds on minimum number of $\cal{C}$-edges of 4-uniform $\cal{C}$-hypergraphs. (English)
Math. Appl. 17, No. 4, 623-628 (2004).
12
$k$-factor and $l$-closure in graphs. (English)
AKCE Int. J. Graphs Comb. 1, No. 1, 15-27 (2004).
13
Subgraphs of maximum matching graphs. (English)
Indian J. Pure Appl. Math. 35, No. 9, 1063-1067 (2004).
14
Minimum number of bridges on connected almost cubic graphs with given deficiency. (English)
J. Comb. Math. Comb. Comput. 48, 33-38 (2004).
15
Subdivisions of $K_{r+2}$ in graphs of average degree at least $r+ε$ and large but constant girth. (English)
Comb. Probab. Comput. 13, No. 3, 361-371 (2004).
16
Amalgamations of factorizations of complete equipartite graphs. (English)
Discrete Math. 284, No. 1-3, 157-175 (2004).
17
On unique $k$-factors and unique $[1,k]$-factors in graphs. (English)
Discrete Math. 278, No. 1-3, 127-138 (2004).
18
A condition for a graph to contain $k$-matching. (English)
Discrete Math. 276, No. 1-3, 375-378 (2004).
19
Packing Petersen graphs into $K_{10}$. (English)
Bull. Inst. Comb. Appl. 39, 85-86 (2003).
20
Result 1 to 20 of 34 total
Start
Contact
Print
General Help
