Result 1 to 20 of 73 total
Circular chromatic numbers of certain planar graphs. (English)
Congr. Numerantium 169, 199-209 (2004).
1
Distance in graphs ‒ taking the long view. (English)
AKCE Int. J. Graphs Comb. 1, No. 1, 1-13 (2004).
2
On a hypercube coloring problem. (English)
J. Comb. Theory, Ser. A 108, No. 2, 199-204 (2004).
3
On the $p$-factor-criticality of the Klein bottle. (English)
Discrete Math. 287, No. 1-3, 171-175 (2004).
4
Breaking symmetry on complete bipartite graphs of odd size. (English)
Integers 3, Paper G04, 9 p., electronic only (2003).
5
A note on defensive alliances in graphs. (English)
Bull. Inst. Comb. Appl. 38, 37-41 (2003).
6
Nonisomorphic trees with first three characteristic numbers equal. (English)
Shum, K. P. (ed.) et al., Advances in algebra. Proceedings of the ICM satellite conference in algebra and related topics, Hong Kong, China, August 14‒17, 2002. River Edge, NJ: World Scientific (ISBN 981-238-260-7/hbk). 271-281 (2003).
7
The total chromatic numbers of joins of sparse graphs. (English)
Australas. J. Comb. 28, 93-105 (2003).
8
Pathwidth of planar and line graphs. (English)
Graphs Comb. 19, No.1, 91-99 (2003).
9
Extremal graphs of order dimension 4. (English)
Math. Scand. 90, No.1, 5-12 (2002).
10
Wagner’s conjecture and the graph-minor project. (Wagners Vermutung und das Graphen-Minoren Projekt.) (German)
Jahresber. Dtsch. Math.-Ver. 104, No.1, 17-25 (2002).
11
Every tree with at most 34 vertices is prime. (English)
Util. Math. 62, 185-190 (2002).
12
On the planarity of Hanoi graphs. (English)
Expo. Math. 20, No.3, 263-268 (2002).
13
Cyclic bi-embeddings of Steiner triple systems on $12s+7$ points. (English)
J. Comb. Des. 10, No.2, 92-110 (2002).
14
Edge maximal non-bipartite graphs without odd cycles of prescribed lengths. (English)
Graphs Comb. 18, No.1, 75-92 (2002).
15
Optimal embeddings of odd ladders into a hypercube. (English)
Discrete Appl. Math. 116, No.1-2, 73-102 (2002).
16
Holes in graphs. (English)
Electron. J. Comb. 9, No.1, Research paper R1, 18 p. (2002); printed version J. Comb. 9, No.1 (2002).
17
Coloring $k$-colorable graphs using smaller palettes. (English)
Kosaraju, Deborah, Proceedings of the 12th annual ACM-SIAM symposium on discrete algorithms. Washington, DC, USA, January 7-9, 2001. Philadelphia, PA: SIAM, Society for Industrial and Applied Mathematics. 319-326 (2001).
18
Extremal size of graphs without a nowhere-zero 3-flow. (English)
Bull. Inst. Comb. Appl. 32, 90-95 (2001).
19
Covering a graph with cuts of minimum total size. (English)
Discrete Math. 237, No.1-3, 129-148 (2001).
20
Result 1 to 20 of 73 total
Start
Contact
Print
General Help
