Abstract
No public abstract is available from the verified source records.
Sara Nasser, Maidoun Mortada, Hamamache Kheddouci
Abstract
Authors
Institutions
No local reference links have been materialized yet.
No local citing links have been materialized yet.
Packing of graphs and applications to computational complexity
10.1016/0095-8956(78)90030-8 · 1978
Every (p,p−2) graph is contained in its complement
10.1002/jgt.3190010308 · 1977
Labeled packing of graphs
2013
Embedding graphs in their complements
10.21136/cmj.1981.101722 · 1981
Packing two copies of a tree into its fourth power
10.1016/s0012-365x(99)00177-6 · 2000
Labeled packing of non-star trees into their kth power, k≥5
2024
Edge disjoint placement of graphs
10.1016/0095-8956(78)90005-9 · 1978
Labeled embedding of (n,n−2)-graphs in their complements
2017
Labeled 2-packings of trees
10.1016/j.disc.2014.12.015 · 2015
Embedding graphs of small size
10.1016/0166-218x(94)90112-0 · 1994
Packing of graphs and permutations-a survey
10.1016/s0012-365x(03)00296-6 · 2004
Provenance
crossref
Confidence 100%
ror
Confidence 99%
ror
Confidence 99%
openalex
Confidence 95%
datacite
Confidence 0%
A note on embedding graphs without small cycles
1991
Packing of graphs-a survey
10.1016/0012-365x(88)90232-4 · 1988
Packing of graphs-a survey
10.1016/0012-365x(88)90232-4 · doi-reference
Packing of graphs and permutations-a survey
10.1016/s0012-365x(03)00296-6 · doi-reference
Embedding graphs of small size
10.1016/0166-218x(94)90112-0 · doi-reference
Labeled 2-packings of trees
10.1016/j.disc.2014.12.015 · doi-reference
Edge disjoint placement of graphs
10.1016/0095-8956(78)90005-9 · doi-reference
Packing two copies of a tree into its fourth power
10.1016/s0012-365x(99)00177-6 · doi-reference
Embedding graphs in their complements
10.21136/cmj.1981.101722 · doi-reference
Every (p,p−2) graph is contained in its complement
10.1002/jgt.3190010308 · doi-reference
Packing of graphs and applications to computational complexity
10.1016/0095-8956(78)90030-8 · doi-reference