Filters








55,947 Hits in 2.9 sec

Non-separable detachments of graphs

Bill Jackson, Tibor Jordán
<span title="">2003</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/g6u5fful5vcr3a7gppc6y47el4" style="color: black;">Journal of combinatorial theory. Series B (Print)</a> </i> &nbsp;
We solve a problem posed by Nash-Williams in [2] by obtaining analogous results for non-separable detachments of graphs. r  ...  Let G ¼ ðV ; EÞ be a graph and r : V-Z þ : An r-detachment of G is a graph H obtained by 'splitting' each vertex vAV into rðvÞ vertices, called the pieces of v in H: Every edge uvAE corresponds to an edge  ...  graph and preserve non-separability.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0095-8956(02)00026-6">doi:10.1016/s0095-8956(02)00026-6</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/rezceqyi4fhbrcuz6vte6ossii">fatcat:rezceqyi4fhbrcuz6vte6ossii</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170923221153/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/087/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDA5NTg5NTYwMjAwMDI2Ng%3D%3D.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c0/5a/c05ad86296e3c00178b9faeb6e171f65f6e951da.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0095-8956(02)00026-6"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Non-Separable Detachments of Graphs

Bill Jackson, Tibor Jordán
<span title="">2001</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/fhi2xwpnh5gmlgof2idwu5wlgq" style="color: black;">Electronic Notes in Discrete Mathematics</a> </i> &nbsp;
We solve a problem posed by Nash-Williams in [2] by obtaining analogous results for non-separable detachments of graphs. r  ...  Let G ¼ ðV ; EÞ be a graph and r : V-Z þ : An r-detachment of G is a graph H obtained by 'splitting' each vertex vAV into rðvÞ vertices, called the pieces of v in H: Every edge uvAE corresponds to an edge  ...  graph and preserve non-separability.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s1571-0653(04)00382-8">doi:10.1016/s1571-0653(04)00382-8</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/nczkwamevfffhmvaripf7tz74u">fatcat:nczkwamevfffhmvaripf7tz74u</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170923221153/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/087/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDA5NTg5NTYwMjAwMDI2Ng%3D%3D.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c0/5a/c05ad86296e3c00178b9faeb6e171f65f6e951da.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s1571-0653(04)00382-8"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

The generic minimal rigidity of a partially triangulated torus [article]

James Cruickshank, Derek Kitson, Stephen Power
<span title="2015-09-02">2015</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Necessary and sufficient conditions are obtained for the minimal 3-rigidity of a simple graph which is obtained from the 1-skeleton of a triangulated torus by the deletion of edges interior to a triangulated  ...  A simple graph is 3-rigid if its generic bar-joint frameworks in R^3 are infinitesimally rigid.  ...  Let G → {G 1 , G • 2 } be a division move associated with a critical separating cycle whose detachment map has associated graph H i .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1509.00711v1">arXiv:1509.00711v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2dsklv3pobc57m7kntjpsfeafa">fatcat:2dsklv3pobc57m7kntjpsfeafa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200831190558/https://arxiv.org/pdf/1509.00711v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/8a/85/8a856e3da9a3190049a5465b4851385f85ac9ea3.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1509.00711v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Page 3581 of Mathematical Reviews Vol. , Issue 2004e [page]

<span title="">2004</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
Press, Cambridge, 1985; MR 87f:05147] by obtaining analogous results for non-separable detachments of graphs.” Vadim E. Zverovich (Bristol) 2004e:05162 05C75 05C10 Marquez, A.  ...  ., are pairwise disjoint for all i > 0, where V° = V(T,,).” 2004e:05161 05C75 Jackson, Bill (4-LNDQM; London); Jordan, Tibor (H-EOTVO-OR; Budapest) Non-separable detachments of graphs.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_2004-05_2004e/page/3581" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_2004-05_2004e/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

A micromechanical approach of suffusion based on a length scale analysis of the grain detachment and grain transport processes

Antoine Wautier, Stéphane Bonelli, François Nicot, F. Radjai, S. Nezamabadi, S. Luding, J.Y. Delenne
<span title="">2017</span> <i title="EDP Sciences"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/oduy4e4fvfhovftixyndrlkomi" style="color: black;">EPJ Web of Conferences</a> </i> &nbsp;
For a uniform grain size distribution, a separation of scales between these two processes exists for the finest particles of a soil  ...  From the definition of transport paths based on a graph description of the pore space the typical lengths scales associated with grain transport are recovered.  ...  As a result, the complex description of the pore space can be reduced to the definition of a graph composed of pores (the nodes of the graph) and constrictions (the edges of the graph).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1051/epjconf/201714009022">doi:10.1051/epjconf/201714009022</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2d557tnmafenrbn2ayctlcrfba">fatcat:2d557tnmafenrbn2ayctlcrfba</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180723225957/https://www.epj-conferences.org/articles/epjconf/pdf/2017/09/epjconf162092.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a4/8f/a48f6df7d4d45810099842988e20c79da75f9e06.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1051/epjconf/201714009022"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Research of Partial Destructive based Selective Disassembly Sequence Planning

Zhou Ziqiang, Dai Guohong, Zhang Xiangyan, Hu Chaobin, Zhang Yongjian
<span title="2015-09-16">2015</span> <i title="Bentham Science Publishers Ltd."> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/g7svpphnp5gwjhgwkecqf6ewza" style="color: black;">The Open Mechanical Engineering Journal</a> </i> &nbsp;
And several rules are defined for reconstructing the hybrid graph of EOL product. And then, an extended Floyd algorithm is proposed for searching optimized disassembly sequence.  ...  This is an open access article licensed under the terms of the (https://creativecommons.org/licenses/by/4.0/legalcode ), which permits unrestricted, non-commercial use, distribution and reproduction in  ...  For the aim of detaching target part or component in EOL product, usually we can not separate the target part by just one operating sequence in the hybrid graph.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2174/1874155x01509010605">doi:10.2174/1874155x01509010605</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vqrpcpvkajgqfosrpkh7zwlrc4">fatcat:vqrpcpvkajgqfosrpkh7zwlrc4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190430203900/https://benthamopen.com/contents/pdf/TOMEJ/TOMEJ-9-605.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/bd/4a/bd4a7aab880d23ac0819ae7a3548bbb66beeb3a3.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2174/1874155x01509010605"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Awareness and knowledge of emergent ophthalmic diseases among non medical students

Kirthika S, Sanjeev Kumar Puri
<span title="2020-12-21">2020</span> <i title="GP Innovations Pvt. Ltd."> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/zcms5chllrfrrhgpoezic7qluq" style="color: black;">International Journal of Research in Pharmaceutical Sciences</a> </i> &nbsp;
Descriptive statistics were represented using bar graphs and tables for better understanding. A total of 201 non medical students were enrolled in this study. The mean age was 23.24 approximately.  ...  Only 42 of 201 were aware of acute angle closure glaucoma (20.9%) and 44 (29.1%) were aware of retinal detachment.  ...  Retinal detachment Retinal detachment is the separation of the neurosensory layer of the retina from the choroid and retinal pigment epithelium underneath.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.26452/ijrps.v11ispl4.4484">doi:10.26452/ijrps.v11ispl4.4484</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/z5mjiq4v4rh7fghahjv664bhzy">fatcat:z5mjiq4v4rh7fghahjv664bhzy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210328235057/https://pharmascope.org/ijrps/article/download/4484/12447" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/da/11/da119ae459b540e7ef85ad7bbc6a6e9f5c6b04a8.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.26452/ijrps.v11ispl4.4484"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Evidence of Non-microtubule Spindle Forces in Mesostoma ehrenbergii Spermatocytes

Eleni Fegaras-Arch, Michael Berns, Arthur Forer
<span title="2020-11-19">2020</span> <i title="Frontiers Media SA"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/zqzewb742bdglfxhkef3ke6cla" style="color: black;">Frontiers in Molecular Biosciences</a> </i> &nbsp;
Thus the movements of detached kinetochores conceivably might be due to recoil from the tension, though we argued against this possibility (Fegaras and Forer, 2018a).  ...  spindle microtubules, kinetochores from each of the 3 bivalents detached from the same pole and rapidly moved to the other pole, at speeds averaging 37.7 μm/min. with some as high as 100 μm/min.  ...  Elastic tethers that extend between the separating arms of all anaphase chromosomes in a variety of cells also extend between the arms of separating Mesostoma spermatocyte anaphase chromosomes .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3389/fmolb.2020.557990">doi:10.3389/fmolb.2020.557990</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/33330616">pmid:33330616</a> <a target="_blank" rel="external noopener" href="https://pubmed.ncbi.nlm.nih.gov/PMC7711074/">pmcid:PMC7711074</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/gstikb6jejb2zd64iaa46z7lya">fatcat:gstikb6jejb2zd64iaa46z7lya</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210717071428/https://escholarship.org/content/qt17b9b521/qt17b9b521.pdf?t=qpn1v7" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/92/f7/92f75893ef09fad9d24ac61fd3bb75369deaec74.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3389/fmolb.2020.557990"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> frontiersin.org </button> </a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7711074" title="pubmed link"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> pubmed.gov </button> </a>

Graphs with at most one crossing [article]

André C. Silva, Alan Arroyo, R. Bruce Richter, Orlando Lee
<span title="2019-04-26">2019</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
The crossing number of a graph G is the least number of crossings over all possible drawings of G. We present a structural characterization of graphs with crossing number one.  ...  Theorem 4 gives an answer to our original question: what makes a graph have crossing number at least 2? Let G be a non-planar graph and let H be a Kuratowski subgraph of G.  ...  A graph G is peripherally 4-connected if G is 3-connected and, for every vertex 3-cut X of G, and, for any partition of the components of G − X into two non-null subgraphs H and K, at least one of H or  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1901.09955v2">arXiv:1901.09955v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vrlazzwwbbbljdoi7xgyupym7m">fatcat:vrlazzwwbbbljdoi7xgyupym7m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200901054313/https://arxiv.org/pdf/1901.09955v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/af/52/af5205e0ef015377512a9edd5c45bb17714c4797.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1901.09955v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Mathematical Modeling of Exudative Retinal Detachment

Ram Avtar, Swati Srivastava
<span title="">2017</span> <i title="Scientific Research Publishing, Inc,"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/t35nyaf3lzb6lei7onyd4hnf4e" style="color: black;">Applied Mathematics</a> </i> &nbsp;
The computational results for the retinal deformation are presented through graphs to illustrate the sensitivity of the deformation to the elastic modulus, the moment of inertia and intraocular pressure  ...  A simple mathematical model for the exudative retinal detachment has been developed.  ...  Rashmi Srivastava (Department of Mathematical Sciences and Computer Application, Bundelkhand University, Jhansi) for the constructive suggestions in view of which the work has been improved.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4236/am.2017.81005">doi:10.4236/am.2017.81005</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/56jn7ccvivh6xoyoszi6yax7iu">fatcat:56jn7ccvivh6xoyoszi6yax7iu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170923021156/http://file.scirp.org/pdf/AM_2017012413452359.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f0/b7/f0b7ec882892eff425c6fc241c41d8eb900acab6.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4236/am.2017.81005"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

An FPT algorithm for the embeddability of graphs into two-dimensional simplicial complexes [article]

Éric Colin de Verdière, Thomas Magnard
<span title="2021-07-13">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
It is known that the problem admits an algorithm with running time f(c).n^O(c), where n is the size of the graph G and c is the size of the two-dimensional complex C.  ...  We consider the embeddability problem of a graph G into a two-dimensional simplicial complex C: Given G and C, decide whether G admits a topological embedding into C.  ...  If f is non-orientable and has (non-orientable) genus at least two, we can add an edge that forms a separating arc in f , cutting that surface into two non-orientable surfaces of genus at least one; it  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2107.06236v1">arXiv:2107.06236v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/d7z7733dwbgz7f2htejsey44rm">fatcat:d7z7733dwbgz7f2htejsey44rm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210719204420/https://arxiv.org/pdf/2107.06236v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ca/83/ca8316158aca49e80a0ebb3276f61f74eafb52cf.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2107.06236v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Foreword

Jaroslav Nešetřil, Marc Noy, Oriol Serra
<span title="">2003</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/civgv5utqzhu7aj6voo6vc5vx4" style="color: black;">Discrete Mathematics</a> </i> &nbsp;
Zmazek: Weak k-reconstruction of cartesian product graphs T. Jordan: Non-separable detachments of graphs J. Korner, A. Monti: Delta-systems and qualitative (in)dependence D. Krob, J. Mairesse, I.  ...  Kawarabayashi: Vertices of degree 6 in a 6-contraction critical graph A.-E. Baert, V. Ravelomanana, L. Thimonier: On the growth of components with non-ÿxed excesses H.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0012-365x(03)00223-1">doi:10.1016/s0012-365x(03)00223-1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/254exoccarc5fa6pw3jt4vh5t4">fatcat:254exoccarc5fa6pw3jt4vh5t4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170926204543/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/450/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDAxMjM2NXgwMzAwMjIzMQ%3D%3D.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a5/7b/a57b5e5c455b43a39b556394ae8014c73ef1f92f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0012-365x(03)00223-1"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Highly edge-connected detachments of graphs and digraphs

Alex R. Berg, Bill Jackson, Tibor Jordán
<span title="2003-03-27">2003</span> <i title="Wiley"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ukzsjb6a6zhyxnjl6nb2mmjc6m" style="color: black;">Journal of Graph Theory</a> </i> &nbsp;
Let G = (V, E) be a graph or digraph and r : V → Z + . An r-detachment of G is a graph H obtained by 'splitting' each vertex v ∈ V into r(v) vertices.  ...  Crispin Nash-Williams [9] gave necessary and sufficient conditions for a graph to have a k-edge-connected r-detachment. He also solved the version where the degrees of all the pieces are specified.  ...  A d-detachment G of a k-edge-connected graph is called admissible if G is also k-edgeconnected. Lemma 3 . 4 . 34 Let G = (V, E) be a k-edge-connected graph (k ≥ 2) and s ∈ V .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/jgt.10104">doi:10.1002/jgt.10104</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ipjh5e5mbrfg5hobaickspysme">fatcat:ipjh5e5mbrfg5hobaickspysme</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20031026041945/http://www.cs.elte.hu:80/egres/tr/egres-01-14.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/84/c0/84c038ee65361ee534224b82b40cb8a9f2b9169c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/jgt.10104"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> wiley.com </button> </a>

'Stop Pub': can banning of junk mail reduce waste production?

Annie Resse
<span title="">2005</span> <i title="SAGE Publications"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/dn5dr5hnnfbv5in7xcgrbc5mqi" style="color: black;">Waste Management &amp; Research</a> </i> &nbsp;
The extra 3% was non-recyclable. Eighty percent of the material in the separate collection was in compliance with the municipal requirements.  ...  Therefore, the quantity of papers and of junk mail deposited in letterboxes varied per inhabitant and per year (Table 3) and is shown in graph form in Figure 5 .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1177/0734242x05051523">doi:10.1177/0734242x05051523</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/15751400">pmid:15751400</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/epm3nrqpzjf2hnanrgs6dv6odu">fatcat:epm3nrqpzjf2hnanrgs6dv6odu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170706070337/http://www.bvsde.paho.org/bvsacd/cd43/annie.pdf?origin%3Dpublication_detail" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/81/b6/81b6ad8784294af95bf7ea6bbeadd5bcf0bd4673.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1177/0734242x05051523"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> sagepub.com </button> </a>

Scale separation between grain detachment and grain transport in granular media subjected to an internal flow

Antoine Wautier, Stéphane Bonelli, François Nicot
<span title="2017-03-07">2017</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/zyk2rftbebd5pm7nkh2swkcq74" style="color: black;">Granular Matter</a> </i> &nbsp;
The comparison between the two length scales highlights a scale separation between grain detachment and grain transport.  ...  From the identification of force chains, particles sensitive to grain detachment are identified.  ...  Macroscopically, if this separation of scales holds, suffusion may be described as the superposition of a detachment and a transport processes.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10035-017-0706-9">doi:10.1007/s10035-017-0706-9</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/az4v3b2azvgarj3jww5r3im624">fatcat:az4v3b2azvgarj3jww5r3im624</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180725024211/https://hal.archives-ouvertes.fr/hal-01720370/file/ax2017-pub00053562.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/76/cc/76cc45c06dcf64fcb2a191d38317d538207dd618.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10035-017-0706-9"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 55,947 results