A. , L. Addario-berry, R. E. Aldred, K. Dalal, and B. A. Reed, Vertex colouring edge partitions, J. Combin. Theory (B), vol.94, pp.237-244, 2005.

S. [. Aigner and . Brandt, Embedding Arbitrary Graphs of Maximum Degree Two, Journal of the London Mathematical Society, vol.2, issue.1, pp.39-51, 1993.
DOI : 10.1112/jlms/s2-48.1.39

M. [. Aho and . Corasick, Efficient string matching: an aid to bibliographic search, Communications of the ACM, vol.18, issue.6, pp.333-340, 1975.
DOI : 10.1145/360825.360855

K. [. Albertson and . Collins, Symmetry breaking in graphs, Electronic Journal of Combinatorics, vol.3, pp.43-55, 1996.

E. [. Alon and . Fischer, 2-factors in dense graphs, Discrete Mathematics, vol.152, issue.1-3, pp.1-3, 1996.
DOI : 10.1016/0012-365X(95)00242-O

A. Al-khalifa, H. V. Jagadish, N. Koudas, J. M. Patel, D. Srivastava et al., Structural joins: a primitive for efficient XML query pattern matching, Proceedings 18th International Conference on Data Engineering, pp.141-152, 2002.
DOI : 10.1109/ICDE.2002.994704

M. Aigner, E. Triesch, and Z. Tuza, Irregular assignments and vertexdistinguishing edge colorings of graphs. Combinatorics '90, Proc. Conf., Gaeta/Italy, pp.1-9, 1990.

M. [. Amer-yahia and . Lalmas, XML search, ACM SIGMOD Record, vol.35, issue.4, pp.16-23, 2006.
DOI : 10.1145/1228268.1228271

C. Bazgan, A. H. Benhamdine, H. Li, and M. Wozniak, On the Vertex-Distinguishing Proper Edge-Colorings of Graphs, Journal of Combinatorial Theory, Series B, vol.75, issue.2, pp.288-301, 1999.
DOI : 10.1006/jctb.1998.1884

C. Bazgan, A. H. Benhamdine, H. Li, and M. Wozniak, A note on the vertex-distinguishing proper coloring of graphs with large minimum degree, Discrete Mathematics, vol.236, issue.1-3, pp.37-42, 2001.
DOI : 10.1016/S0012-365X(00)00428-3

P. N. Balister, B. Bollobas, and R. Schelp, Vertex distinguishing colorings of graphs with ??(G)=2, Discrete Mathematics, vol.252, issue.1-3, pp.17-29, 2002.
DOI : 10.1016/S0012-365X(01)00287-4

S. [. Bollobás and . Eldridge, Packings of graphs and applications to computational complexity, Journal of Combinatorial Theory, Series B, vol.25, issue.2, pp.105-124, 1978.
DOI : 10.1016/0095-8956(78)90030-8

]. M. Beh65 and . Behzad, Graphs and their chromatic numbers, 1965.

]. C. Ber60 and . Berge, Les problèmes de coloration en théorie des graphes. Publication de l'Institut de Statistique de l'Université de Paris 9, pp.123-160, 1960.

]. C. Ber61 and . Berge, Färbung von graphen, deren sämtliche bzw, deren ungerade kreise starr sind, Wissenschaftliche Zeitschrift. Martin Luther Universitat Halle Wittenberg 10, pp.114-115, 1961.

B. Bollobás, A. Kostochka, and K. Nakprasit, Packing d-degenerate graphs, Journal of Combinatorial Theory, Series B, vol.98, issue.1, pp.85-94, 2008.
DOI : 10.1016/j.jctb.2007.05.002

N. Bruno, N. Koudas, and D. Srivastava, Holistic twig joins, Proceedings of the 2002 ACM SIGMOD international conference on Management of data , SIGMOD '02, pp.310-321, 0118.
DOI : 10.1145/564691.564727

L. Baril, H. Kheddouci, and O. Togni, The irregularity strength of circulant graphs, Discrete Mathematics, vol.304, issue.1-3, pp.1-10, 2005.
DOI : 10.1016/j.disc.2005.09.006

]. B. Bol78 and . Bollobás, Extremal Graph Theory, 1978.

]. R. Bro41 and . Brooks, On colouring the nodes of a network, Proc. Cambridge Philos. Soc, pp.194-197, 1941.

S. [. Burns and . Schuster, Every (p,p-2) graph is contained in its complement, Journal of Graph Theory, vol.1, issue.3, pp.277-279, 1977.
DOI : 10.1002/jgt.3190010308

S. [. Burns and . Schuster, Embedding (p,p???1) graphs in their complements, Israel Journal of Mathematics, vol.1, issue.4, pp.313-320, 1978.
DOI : 10.1007/BF02761996

R. [. Burris and . Schelp, Vertex-distinguishing proper edge-colorings, Journal of Graph Theory, vol.26, issue.2, pp.73-82, 1997.
DOI : 10.1002/(SICI)1097-0118(199710)26:2<73::AID-JGT2>3.0.CO;2-C

]. J. Bur88 and . Burghardt, A tree pattern matching algorithm with reasonable space requirements, CAAP'88, pp.1-15, 1988.

]. A. Bur93 and . Burris, Vertex-distinguishing edge-colorings, 1993.

]. A. Bur94 and . Burris, On graphs with irregular coloring number 2, Congr. Numerantium, vol.100, pp.129-140, 1994.

]. A. Bur95 and . Burris, The irregular coloring number of a tree, Discrete Math, vol.141, issue.50, pp.279-283, 1995.

A. [. Benhocine and . Wojda, On self-complementation, Journal of Graph Theory, vol.1, issue.3, pp.85-91, 1985.
DOI : 10.1002/jgt.3190090305

M. [. Brandt and . Wozniak, On Cyclic Packing of a Tree, Graphs and Combinatorics, vol.20, issue.4, pp.435-442, 2004.
DOI : 10.1007/s00373-004-0583-y

]. P. Cat74 and . Catlin, Subgraphs of graphs, Discrete Math, vol.10, pp.225-233, 1974.

E. A. Campi, S. Damiani, S. Guinea, G. Marrara, P. Pasi et al., A fuzzy extension of the XPath query language, Journal of Intelligent Information Systems, vol.8, issue.4, pp.285-305, 2009.
DOI : 10.1007/s10844-008-0066-3

G. Chartrand, H. Escuadro, F. Okamota, and P. Zhang, Detectable colorings of graphs, Utilitas Mathematica, vol.69, issue.20, pp.13-32, 2006.

J. [. Chow and . Hennessy, The priority-based coloring approach to register allocation, Proc. Cambridge Philos. Soc, pp.501-536, 1990.
DOI : 10.1145/88616.88621

R. [. Cole and . Hariharan, Tree pattern matching and subset matching in randomized o(nlog 3 m) time, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, pp.66-75, 1997.

R. [. Cole and . Hariharan, Tree Pattern Matching to Subset Matching in Linear Time, SIAM Journal on Computing, vol.32, issue.4, pp.1056-1066, 2003.
DOI : 10.1137/S0097539700382704

]. D. Cha87 and . Chase, An improvement to bottom-up tree pattern matching, POPL'87, pp.168-177, 1987.

J. Cerny, M. Hornak, and R. Sotak, Observability of a graph, Math. Slovaca, vol.46, issue.18, pp.21-31, 1996.

M. G. Chartrand, J. Jacobson, O. R. Lehel, S. Oellermann, F. Ruiz et al., Irregular networks, Congr. Numerantium, vol.64, issue.18, pp.187-192, 1988.

T. Chen, J. Lu, and T. W. Ling, On boosting holism in XML twig pattern matching using structural indexing techniques, Proceedings of the 2005 ACM SIGMOD international conference on Management of data , SIGMOD '05, pp.455-466, 2005.
DOI : 10.1145/1066157.1066209

H. S. Chen, J. Li, W. P. Tatemura, D. Hsiung, K. S. Agrawal et al., Twig2Stack: bottom-up processing of generalized-tree-pattern queries over XML documents, Proceedings of the 32nd international conference on Very large data bases, VLDB '06, pp.283-294, 2006.

B. Csaba, A. Shokoufandeh, and E. Szemerédi, Proof of a Conjecture of Bollob??s and Eldridge for Graphs of Maximum Degree Three*, COMBINATORICA, vol.23, issue.1, pp.35-72, 2003.
DOI : 10.1007/s00493-003-0013-4

P. [. Chartrand and . Zhang, Introduction to graph theory, 2005.

P. [. Chartrand and . Zhang, Chromatic Graph Theory, Boca Raton, vol.20084267, 2008.
DOI : 10.1201/9781584888017

J. [. Dao and . Cao, A Glance on Current XML Twig Pattern Matching Algorithms, ICCSA (2)'08, pp.307-321, 2008.
DOI : 10.1007/978-3-540-69848-7_25

M. Dubiner, Z. Galil, and E. Magen, Faster tree pattern matching, Journal of the ACM, vol.41, issue.2, pp.205-213, 1994.
DOI : 10.1145/174652.174653

]. N. Eat00 and . Eaton, A near packing of two graphs, J. Comb. Theory Ser. B, vol.80, pp.98-103, 2000.

T. [. Erd?s and . Gallai, On maximal paths and circuits of graphs, Acta Mathematica Academiae Scientiarum Hungaricae, vol.1, issue.3, pp.337-356, 1959.
DOI : 10.1007/BF02024498

L. [. Entringer and . Gassman, Line-critical point determining and point distinguishing graphs, Discrete Mathematics, vol.10, issue.1, pp.43-55, 1974.
DOI : 10.1016/0012-365X(74)90019-3

Z. [. Escuadro and . Ping, On detectable colorings of graphs, Mathematica Bohemica, vol.130, pp.427-445, 2005.

]. L. Eul41 and . Euler, Solutio problematis ad geometriam situs pertinentis, Academiae Sci. I. Petropolitanae, vol.8, pp.128-140

. Fmp-+-12-]-e, A. Flandrin, J. Marczyk, J. F. Przybylo, M. Sacló et al., Neighbor sum distinguishing index. Graphs and Combinatorics, pp.1-8

C. [. Faudree, R. H. Rousseau, S. Schelp, and . Schuster, Embedding graphs in their complements, Czechoslovak Math. J, issue.106, pp.3153-62, 1981.

]. A. Gam86 and . Gamst, Some lower bounds for a class of frequency assignment problems, IEEE Transactions on Vehicular Technology, vol.35, issue.1, pp.8-14, 1986.

E. Györi, M. Hornák, C. Palmer, and M. Wozniak, General neighbourdistinguishing index of a graph, Discrete Mathematics, pp.827-831, 2008.

D. [. Garey and . Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freman and Company, 1979.

M. Grötschel, L. Lovàsz, and A. Schrijver, Polynomial Algorithms for Perfect Graphs, Annals of Discrete Mathematic, vol.21, pp.169-197, 1984.
DOI : 10.1016/S0304-0208(08)72943-8

A. [. Görlich and . Zak, A note on packing graphs without cycles of length up to five, Electr. J. Comb, vol.16, issue.1, 2009.

]. P. Haj91 and . Hajnal, An ?(n 4 3 ) lower bound on the randomized decision tree complexity of graph properties, Combinatorica, vol.11, pp.131-143, 1991.

]. F. Har69 and . Harary, Graph Theory, 1969.

]. F. Har96 and . Harary, Survey of methods of automorphism destruction in graphs Invited address, Eighth Quadrennial International Conference on Graph Theory, Combinatorics, Algorithms and Applications, 1996.

]. F. Har01 and . Harary, Methods of destroying the symmetries of a graph, Bull. Malaysian Math. Sci. Soc, vol.24, issue.2, pp.183-191, 2001.

S. [. Hedetuiemi, P. J. Hedetniemi, and . Slater, A note on packing two trees into k n, Ars Combin, vol.11, pp.149-153, 1981.

O. [. Hakimi and . Kaziv, On a generalization of edge-coloring in graphs, Journal of Graph Theory, pp.139-154, 1986.

C. [. Haw and . Lee, Node labeling schemes in XML query optimization: A survey and trends, IETE Technical Review, vol.26, issue.2, pp.88-100, 2009.

R. [. Harary and . Melter, On the metric dimension of a graph, Ars Combin, vol.2, pp.191-195, 1976.

M. [. Hoffman, Pattern Matching in Trees, Journal of the ACM, vol.29, issue.1, pp.68-95, 1982.
DOI : 10.1145/322290.322295

]. I. Hol81 and . Holyer, The np-completeness of edge-colouring, SIAM J. Comput, vol.10, issue.4, pp.718-720, 1981.

. [. Bibliography, M. Harary, and . Plantholt, The point-distinguishing chromatic index. Graphs and Applications, pp.147-162, 1985.

A. [. Huang and . Rosa, Decomposition of complete graphs into trees, Ars Combin, vol.5, pp.26-63, 1978.

E. [. Hajnal, . Szemerédip, A. Erdos, and V. T. Renyi, Proof of conjecture of erdos. in: Combinatorial Theory and its Applications, pp.601-623, 1970.

R. [. Hornak and . Sotak, Localization of jumps of the point-distinguishing chromatic index of K_{n,n}, Discussiones Mathematicae Graph Theory, vol.17, issue.2, pp.243-251, 1997.
DOI : 10.7151/dmgt.1051

N. [. Hornak and . Salvi, On the point-distinguishing chromatic index of complete bipartite graphs, Ars Combinatoria, vol.80, pp.75-85, 2006.

D. [. Hilton and . De-werra, Sufficient conditions for balanced and for equitable edge-colorings of graphs, O. R. Working paper, vol.823, 1982.

T. [. Izadi, M. S. Harder, and . Haghjoo, S3: Evaluation of tree-pattern XML queries supported by structural summaries, Proceedings of Data and Knowledge Engineering, pp.126-145, 2009.
DOI : 10.1016/j.datak.2008.09.001

J. Jiang, C. Luo, W. C. Hou, Q. Zhu, and D. Che, Efficient Processing of XML Twig Pattern: A Novel One-Phase Holistic Solution, DEXA 07, pp.87-97, 2007.
DOI : 10.1007/978-3-540-74469-6_10

H. Jiang, W. Wang, H. Lu, and J. X. Yu, Holistic Twig Joins on Indexed XML Documents, Proceedings of VLDB, pp.273-284, 2003.
DOI : 10.1016/B978-012722442-8/50032-X

B. [. Jun-qiao and . Yue-hua, Upper bounds on vertex distinguishing chromatic index of some halin graphs, Discrete Mathematics, vol.27, issue.3, pp.329-334

]. J. Kaz12 and . Kaziów, Multiplicative vertex-colouring weightings of graphs, Information Processing Letters, vol.112, issue.18, pp.191-194, 2012.

]. H. Khe03 and . Kheddouci, A note on packing of two copies of some trees into their third power, Applied Mathematics Letters, vol.16, pp.1115-1121, 2003.

H. Kaul, A. Kostochka, and G. Yu, On a graph packing conjecture by Bollob??s, Eldridge and Catlin, Combinatorica, vol.72, issue.1, pp.469-485, 2008.
DOI : 10.1007/s00493-008-2278-0

M. Karoóski, T. Luczak, and A. Thomason, Edge weights and vertex colours, Journal of Combinatorial Theory, Series B, vol.91, issue.1, pp.151-157, 2004.
DOI : 10.1016/j.jctb.2003.12.001

H. Kheddouci, S. Marshall, J. F. Saclé, and M. Wozniak, On the packing of three graphs, Discrete Mathematics, vol.236, issue.1-3, pp.236197-225, 2001.
DOI : 10.1016/S0012-365X(00)00443-X
URL : https://hal.archives-ouvertes.fr/hal-00192130

]. S. Kos89 and . Kosaraju, Efficient tree pattern matching, Proceedings of the 30th Annual Symposium on Foundations of Computer Science, pp.178-183, 1989.

. [. László, Normal hypergraphs and the perfect graph conjecture, Discrete Mathematics, vol.2, issue.3, pp.253-267, 1972.

R. [. Lalmas and . Baeza-yates, Structured document retrieval, Encyclopedia of Database Systems, pp.2867-2868, 2009.

J. Lu, T. Chen, and T. W. Ling, Efficient processing of XML twig patterns with parent child edges, Proceedings of the Thirteenth ACM conference on Information and knowledge management , CIKM '04, pp.533-542, 0118.
DOI : 10.1145/1031171.1031272

]. F. Lei79 and . Leighton, A graph coloring algorithm for large sceduling problems, Journal of Research of the National Bureau of Standards, vol.84, issue.6, pp.489-503, 1979.

J. [. Li, Y. Feng, L. Zhang, and . Zhou, Efficient Holistic Twig Joins in Leaf-to-Root Combining with Root-to-Leaf Way, DASFAA, pp.834-849, 0118.
DOI : 10.1007/978-3-540-71703-4_69

J. Lu, T. W. Ling, C. Y. Chan, and T. Chen, From region encoding to extended Dewey: On efficient processing of XML twig pattern matching, Proceedings of the 31st International Conference on Very Large Data Bases (VLDB), pp.193-204, 2005.

J. Lu, X. Meng, and T. W. Ling, Indexing and querying XML using extended Dewey labeling scheme, Data & Knowledge Engineering, vol.70, issue.1, pp.35-59, 2011.
DOI : 10.1016/j.datak.2010.08.001

]. D. Bibliography-[-luc92 and . Lucas, Récréations mathématiques. Gauthiers Villars, p.1892

J. Li and J. Wang, Fast Matching of Twig Patterns, Proceedings of the 19th international conference on Database and Expert Systems Applications , DEXA '08, pp.523-536, 2008.
DOI : 10.1007/978-3-540-85654-2_45

J. Li and J. Wang, TwigBuffer: Avoiding Useless Intermediate Solutions Completely in Twig Joins, Proceedings of the 13th international conference on Database systems for advanced applications, DASFAA'08, pp.554-561, 2008.
DOI : 10.1007/978-3-540-78568-2_46

T. [. Nakano, N. Nishizeki, and . Saito, On the f-coloring of multigraphs, IEEE Transactions on Circuits and Systems, vol.35, issue.3, pp.345-353, 1988.
DOI : 10.1109/31.1747

L. Qin, J. X. Yu, and B. Ding, TwigList: Make Twig Pattern Matching Fast, Proceedings of the 12th international conference on Database systems for advanced applications (DASFAA), DASFAA'07, pp.850-862, 2007.
DOI : 10.1007/978-3-540-71703-4_70

B. [. Rao and . Moon, Prix: Indexing and querying XML using prüfer sequences, ICDE'04, pp.288-300, 2004.

R. [. Rudasov and . Sotak, Vertex-distinguishing proper edge colourings of some regular graphs, Discrete Mathematics, vol.308, issue.5-6, pp.795-802, 2008.
DOI : 10.1016/j.disc.2007.07.019

. [. Sánchez-arroyo, Determining the total colouring number is np-hard, Discrete Mathematics, vol.78, issue.3, pp.315-319, 1989.
DOI : 10.1016/0012-365X(89)90187-8

]. Sal90 and . Salvi, On the value of the point-distinguishing chromatic index of k n,n, Ars Combin, vol.29, issue.B, pp.235-244, 1990.

]. P. Sey90 and . Seymour, Colouring series-parallel graphs, Combinatorica, vol.10, pp.345-353, 1990.

J. [. Sauer and . Spencer, Edge disjoint placement of graphs, Journal of Combinatorial Theory, Series B, vol.25, issue.3, pp.295-302, 1978.
DOI : 10.1016/0095-8956(78)90005-9

D. P. Sumner, Point determination in graphs, Discrete Mathematics, vol.5, issue.2, pp.179-187, 1973.
DOI : 10.1016/0012-365X(73)90109-X

Y. [. Sanders and . Zhao, Planar Graphs of Maximum Degree Seven are Class I, Journal of Combinatorial Theory, Series B, vol.83, issue.2, pp.201-212, 2001.
DOI : 10.1006/jctb.2001.2047

E. [. Tahraoui, H. Duchêne, and . Kheddouci, Gap vertexdistinguishing edge colorings of graphs, Discrete Mathematics, issue.20, pp.3123011-3025
URL : https://hal.archives-ouvertes.fr/hal-01353069

. A. Tpsn-+-12-]-m, K. Tahraoui, L. Pinel-sauvagnat, C. Ning, M. Laitang et al., A survey on tree matching and xml retrieval, Computer Science Review, p.2012

]. A. Tro09 and . Trotman, Processing structural constraints, Encyclopedia of Database Systems, pp.2191-2195, 2009.

B. [. Trotman and . Sigurbjornsson, Narrowed Extended XPath I (NEXI), Proceedings of the 3rd Workshop of the INitiative for the Evaluation of XML retrieval (INEX), pp.16-40, 2004.
DOI : 10.1007/11424550_2
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.65.2520

]. V. Viz64 and . Vizing, On an estimate of the chromatic class of a p-graph, Diskret. Analiz, vol.3, pp.25-30, 1964.

]. V. Viz65 and . Vizing, Critical graphs with given chromatic class, Metody Diskret. Analiz, vol.5, issue.16, pp.9-17, 1965.

]. W3c98b and . W3c, EXtensible Markup Language (XML) 1.0, World Wide Web Consortium (W3C), Recommendation, 1998.

]. W3c07b and . W3c, XML Path Language (XPath) 2.0, World Wide Web Consortium (W3C), Recommendation, 2007.

]. D. Wer74 and . De-werra, Some results in chromatic scheduling, Zeitschrift fur Operations Research, vol.18, pp.167-175, 1974.

]. D. Wer75 and . De-werra, A few remarks on chromatic scheduling, in combinatorial programming, Methods, pp.337-342, 1975.

]. D. Bibliography-[-wer85 and . De-werra, An introduction to timetabling, European Journal of Operational Research, vol.19, pp.151-162, 1985.

]. D. Wes96 and . West, An Introduction to Graph Theory, 1996.

A. [. De-werra and . Hertz, Graph Colouring and Variations, Annals of Discrete Mathematics (Hardcover), 1989.

G. [. Wu and . Liu, XML twig pattern matching using version tree, Data & Knowledge Engineering, vol.64, issue.3, pp.580-599, 2008.
DOI : 10.1016/j.datak.2007.09.013

H. Wang and X. Meng, On the sequencing of tree structures for XML indexing, Proceeding of ICDE, pp.372-383, 2005.

M. Wozniak, A note on embedding raphs without short cycles, Colloq. Math. Soc. Janos Bolyai, vol.60, pp.727-732, 1991.

M. Wozniak, Embedding graphs of small size, Discrete Applied Mathematics, vol.51, issue.1-2, pp.233-241, 1994.
DOI : 10.1016/0166-218X(94)90112-0

M. Wozniak, Packing three trees, Discrete Mathematics, vol.150, issue.1-3, pp.393-402, 1996.
DOI : 10.1016/0012-365X(95)00204-A

M. Wozniak, On cyclically embeddable graphs, Discussiones Mathematicae Graph Theory, vol.19, issue.2, pp.241-248, 1999.
DOI : 10.7151/dmgt.1099

M. Wozniak, Packing of graphs and permutations???a survey, Discrete Mathematics, vol.276, issue.1-3, pp.379-391, 2004.
DOI : 10.1016/S0012-365X(03)00296-6

S. [. Wang, W. Park, .. S. Fan, and . Yu, ViST, Proceedings of the 2003 ACM SIGMOD international conference on on Management of data , SIGMOD '03, pp.110-121, 2003.
DOI : 10.1145/872757.872774

N. [. Wang and . Saner, Packing Three Copies of a Tree into a Complete Graph, European Journal of Combinatorics, vol.14, issue.2, pp.137-142, 1993.
DOI : 10.1006/eujc.1993.1018

T. K. Woo, S. Y. Su, and R. N. Wolfe, Resource allocation in a dynamically partitionable bus network using a graph coloring algorithm, IEEE Transactions on Communications, vol.39, issue.12, pp.1794-1801, 2002.
DOI : 10.1109/26.120165

M. Wozniak and A. P. Wojda, Triple placement of graphs, Graphs and Combinatorics, vol.25, issue.1, pp.85-91, 1993.
DOI : 10.1007/BF01195330

G. [. Zezula, F. Amato, F. Debole, and . Rabitti, Tree Signatures for XML Querying and Navigation, Xsym'03, pp.149-163, 2003.
DOI : 10.1007/978-3-540-39429-7_10

]. A. Zak11 and . Zak, A note on k-placeable graphs, Discrete Mathematics, issue.22, pp.3112634-2636, 2011.

]. L. Zha00 and . Zhang, Every planar graph with maximum degree 7 is class 1. Graphs and combinatorics, pp.467-495, 2000.

Z. Zhang, L. Liu, and J. Wang, Adjacent strong edge coloring of graphs, Applied Mathematics Letters, vol.15, issue.5, pp.623-626, 2002.
DOI : 10.1016/S0893-9659(02)80015-5

P. Zezula, F. Mandreoli, and R. Martoglia, Tree Signatures and Unordered XML Pattern Matching, 30th Conference on Current Trends in Theory and Practice of Computer Science, Merin, Czech Republic, pp.122-139, 2004.
DOI : 10.1007/978-3-540-24618-3_10

C. Zhang, J. Naughton, D. Dewitt, Q. Luo, and G. Lohman, On supporting containment queries in relational database management systems, Proceedings of the 2001 ACM SIGMOD international conference on Management Of Data, pp.425-426, 2001.

J. Zhou, M. Xie, and X. Meng, TwigStack+: Holistic twig join pruning using extended solution extension, Wuhan University Journal of Natural Sciences, vol.12, issue.5, pp.855-860, 2007.
DOI : 10.1007/s11859-007-0032-x