Filters








1,611 Hits in 4.0 sec

On point-linear arboricity of planar graphs

Jianfang Wang
<span title="">1988</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/civgv5utqzhu7aj6voo6vc5vx4" style="color: black;">Discrete Mathematics</a> </i> &nbsp;
Introduction Chartrand [l] studied the point-arboricity of planar graphs and showed that the point-arboricity of a planar graph does not exceed 3. Now we will discuss the point-linear arboricity.  ...  It can be proved that if G is a planar graph with JVJ = n s 8 then pO(G) < 2. However, there exists a planar graph with n = 9, its point-linear arboricity is larger than 2.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0012-365x(88)90229-4">doi:10.1016/0012-365x(88)90229-4</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/sqewodykezaehkftswqru7eja4">fatcat:sqewodykezaehkftswqru7eja4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190312074807/https://core.ac.uk/download/pdf/82027905.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/41/13/41138c1c9db0ee453f8497753dce40c36c503642.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0012-365x(88)90229-4"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Planar Projections of Graphs [chapter]

N. R. Aravind, Udit Maniyar
<span title="">2020</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Finally, we obtain bounds in terms of parameters such as geometric thickness and linear arboricity.  ...  We show that the complete graph on n vertices has a representation in ⌈√(n/2)+1 ⌉ planes.  ...  The linear arboricity of a graph G is the minimum number of linear forests into which the edges of G can be decomposed. We have the following. Proposition 1.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-030-39219-2_36">doi:10.1007/978-3-030-39219-2_36</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ey4x3ra2lnh6zksfqbfixtplaa">fatcat:ey4x3ra2lnh6zksfqbfixtplaa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201011085217/https://arxiv.org/pdf/2010.01286v1.pdf" title="fulltext PDF download [not primary version]" 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] <span style="color: #f43e3e;">&#10033;</span> <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/76/24/7624d2fcb2160288da771dbf2ea65c6985ce6fd1.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-030-39219-2_36"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Arboricity and bipartite subgraph listing algorithms

David Eppstein
<span title="">1994</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/5xfy4fcdxvcvdiybp6iqbffqc4" style="color: black;">Information Processing Letters</a> </i> &nbsp;
In graphs of bounded arboricity, the total complexity of all maximal complete bipartite subgraphs is O(n). We describe a linear time algorithm to list such subgraphs.  ...  The arboricity bound is necessary: for any constant k and any n there exists an n-vertex graph with O(n) edges and (n/ log n) k maximal complete bipartite subgraphs K k, .  ...  A decomposition of a planar graph into three forests can be found in linear time [7, 18] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0020-0190(94)90121-x">doi:10.1016/0020-0190(94)90121-x</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ej4wcu747ne2rhvlgbcj2fnbda">fatcat:ej4wcu747ne2rhvlgbcj2fnbda</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170813151355/http://www.ics.uci.edu/~eppstein/pubs/Epp-TR-94-11.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/9b/05/9b051d80c60bc2b418bf9f15445c9fa23ee194db.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0020-0190(94)90121-x"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Page 469 of Mathematical Reviews Vol. 40, Issue 3 [page]

<span title="">1970</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;
Circuit Theory (Ann Arbor, Mich., 1964), pp. 67-75, Univ. of Michigan Press, Ann Arbor, Mich., 1964] that an arbitrary graph is planar if and only if a suitable set of pseudo-Hamiltonian graphs, derived  ...  to identify planar sub- graphs of a nonplanar graph.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1970-09_40_3/page/469" 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_1970-09_40_3/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Bounded diameter arboricity

Martin Merker, Luke Postle
<span title="2018-11-04">2018</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;
We use these results to characterize the bounded diameter arboricity for planar graphs of girth at least g for all g = 5.  ...  Moreover, we answer a question by Mütze and Peter leading to an improved lower bound on the density of globally sparse Ramsey graphs.  ...  The first variant, introduced by Harary [10] in 1970 is linear arboricity, denoted Υ L (G), wherein the graph is decomposed into linear forests, where a linear forest is the disjoint union of paths.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/jgt.22416">doi:10.1002/jgt.22416</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/yh5ghdnbdjcwdnp7coojvhz3my">fatcat:yh5ghdnbdjcwdnp7coojvhz3my</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200309235116/https://backend.orbit.dtu.dk/ws/portalfiles/portal/162440759/Bounded_Diameter_Arboricity.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/51/ca/51caf47cf94799b2c9198e0df539faa9029b5b14.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/jgt.22416"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> wiley.com </button> </a>

Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way

Matthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Y. Meng
<span title="">2005</span> <i title="Journal of Graph Algorithms and Applications"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/4joumle7hffilk276fkubvhxcq" style="color: black;">Journal of Graph Algorithms and Applications</a> </i> &nbsp;
ones) to test if a non-planar graph can be drawn efficiently in a confluent way.  ...  Our approach is to use a technique we call confluent drawing for visualizing non-planar graphs in a planar way.  ...  Acknowledgments We would like to thank Jie Ren and André van der Hoek for supplying us with several examples of graphs used in software visualization.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.7155/jgaa.00099">doi:10.7155/jgaa.00099</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/orii7er2krhzjdphrgq5a3ttre">fatcat:orii7er2krhzjdphrgq5a3ttre</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20051231080829/http://www.cs.brown.edu:80/publications/jgaa/accepted/2005/Dickerson+2005.9.1.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/21/44/21443144d398fec6e34435113edddb80147ebebf.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.7155/jgaa.00099"> <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>

Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way [chapter]

Matthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Yu Meng
<span title="">2004</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
ones) to test if a non-planar graph can be drawn efficiently in a confluent way.  ...  Our approach is to use a technique we call confluent drawing for visualizing non-planar graphs in a planar way.  ...  Acknowledgments We would like to thank Jie Ren and André van der Hoek for supplying us with several examples of graphs used in software visualization.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-24595-7_1">doi:10.1007/978-3-540-24595-7_1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5xkk3immgffmta45m6rpmalb7y">fatcat:5xkk3immgffmta45m6rpmalb7y</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20051231080829/http://www.cs.brown.edu:80/publications/jgaa/accepted/2005/Dickerson+2005.9.1.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/21/44/21443144d398fec6e34435113edddb80147ebebf.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-24595-7_1"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Vertex and Tree Arboricities of Graphs

Gerard J. Chang, Chiuyuan Chen, Yaping Chen
<span title="">2004</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/tsm6lnbvf5ahzjp7czojbjig5i" style="color: black;">Journal of combinatorial optimization</a> </i> &nbsp;
This paper studies the vertex and the tree arboricities on various classes of graphs for exact values, algorithms, bounds, hamiltonicity and NP-completeness.  ...  This paper studies the following variations of arboricity of graphs.  ...  Typical examples are linear arboricity, linear k-arboricity and star arboricity, whose definitions are the same as arboricity except that each subset of E(G) induces a graph whose components are paths,  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1023/b:joco.0000038912.82046.17">doi:10.1023/b:joco.0000038912.82046.17</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zq75b47o3ffjjkd7s2r6r76gde">fatcat:zq75b47o3ffjjkd7s2r6r76gde</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170815110600/https://ir.nctu.edu.tw/bitstream/11536/26385/1/000223483800004.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/7b/eb/7beb537780e659a993ee31484ca5f922dae2bcc5.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1023/b:joco.0000038912.82046.17"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way [article]

Matthew Dickerson and David Eppstein and Michael T. Goodrich and Jeremy Meng
<span title="2002-12-17">2002</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Producing such confluent diagrams automatically from a graph with many crossings is quite challenging, however, so we offer two heuristic algorithms to test if a non-planar graph can be drawn efficiently  ...  In addition, we identify several large classes of graphs that can be completely categorized as being either confluently drawable or confluently non-drawable.  ...  Acknowledgments We would like to thank Jie Ren and André van der Hoek for supplying us with several examples of graphs used in software visualization.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/cs/0212046v1">arXiv:cs/0212046v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ddd3siotgrhddkypysi4fy7wjy">fatcat:ddd3siotgrhddkypysi4fy7wjy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171008202353/https://core.ac.uk/download/pdf/2418767.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/f6/3c/f63c38edccc5f087dea29194fc5157c793c2bc07.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/cs/0212046v1" 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 20 of Mathematical Reviews Vol. 41, Issue 1 [page]

<span title="">1971</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;
The author states a similar “Pésa- type” result for n-connectedness and proves a generaliza- tion of Pésa’s theorem (case k=0): Let G be a graph on p points (vertices) and let 0<k<p-—2.  ...  Extremal nonseparable graphs of diameter 2. Proof Techniques in Graph Theory (Proc. Second Ann Arbor Graph Theory Conf., Ann Arbor, Mich., 1968), pp. 111-118. Academic Press, New York, 1969.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1971-01_41_1/page/20" 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_1971-01_41_1/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Three ways to cover a graph [article]

Kolja Knauer, Torsten Ueckerdt
<span title="2015-10-02">2015</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
The classical graph parameters that result this way are interval number, track number, linear arboricity, star arboricity, and caterpillar arboricity.  ...  We provide new bounds on each covering number with respect to the following covering classes: linear forests, star forests, caterpillar forests, and interval graphs.  ...  West for useful comments improving the presentation of the paper.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1205.1627v3">arXiv:1205.1627v3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/clp6x5vpb5cprcoz34zhcz5zsy">fatcat:clp6x5vpb5cprcoz34zhcz5zsy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200909161647/https://arxiv.org/pdf/1205.1627v3.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/7b/7e/7b7e0530a51c1a423bd6aa97728f7f6d124b10fb.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1205.1627v3" 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>

Adjacency queries in dynamic sparse graphs

Łukasz Kowalik
<span title="">2007</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/5xfy4fcdxvcvdiybp6iqbffqc4" style="color: black;">Information Processing Letters</a> </i> &nbsp;
We consider graphs of bounded arboricity, i.e., graphs with no dense subgraphs, like for example planar graphs.  ...  This last result holds even for graphs of arboricity bounded by O(log k n), for some constant k.  ...  Intuitively, graphs of bounded arboricity are uniformly sparse, i.e., they do not have dense subgraphs. (In particular, planar graphs have arboricity 3.)  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.ipl.2006.12.006">doi:10.1016/j.ipl.2006.12.006</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/qh4cjwaqwfd3zjk3s5qxajkuve">fatcat:qh4cjwaqwfd3zjk3s5qxajkuve</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809134433/https://www.mimuw.edu.pl/~kowalik/papers/adjacency.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/82/a7/82a7b67c9469cc7d32c5ee5b9fa5e85cda838ba2.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.ipl.2006.12.006"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Drawing Graphs on Few Lines and Few Planes [article]

Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff
<span title="2016-09-01">2016</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We pay special attention to planar graphs. For example, we show that there are planar graphs that can be drawn in 3-space on a lot fewer lines than in the plane.  ...  We relate our parameters to standard combinatorial characteristics of graphs (such as the chromatic number, treewidth, maximum degree, or arboricity) and to parameters that have been studied in graph drawing  ...  Graph Algorithms Appl. 19(1), 393-412 (2015) 41. Wang, J.: On point-linear arboricity of planar graphs.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1607.01196v2">arXiv:1607.01196v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/g7d2y7bb5jaqhg7prlimtfgxce">fatcat:g7d2y7bb5jaqhg7prlimtfgxce</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200826160927/https://arxiv.org/pdf/1607.01196v2.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/86/33/8633dd1afe739c65a90a71eb984084b123342e44.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1607.01196v2" 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 3176 of Mathematical Reviews Vol. , Issue 90F [page]

<span title="">1990</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;
On the other hand, there are planar graphs with st(G) = 5.  ...  901:05097 90f:05097 05C50 Shearer, James B. (1-IBM) On the distribution of the maximum eigenvalue of graphs. Linear Algebra Appl. 114/115 (1989), 17-20.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1990-06_90f/page/3176" 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_1990-06_90f/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

On graph thickness, geometric thickness, and separator theorems

Christian A. Duncan
<span title="">2011</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/is2k7576zbherpepqy3y7zkzuy" style="color: black;">Computational geometry</a> </i> &nbsp;
We investigate the relationship between geometric thickness, thickness, outerthickness, and arboricity of graphs.  ...  The technique used can be extended to other classes of graphs so long as a separator theorem exists.  ...  Acknowledgements We would like to thank David Eppstein and David Wood for several helpful discussions on this topic leading to the results in this paper and to the various referees for their helpful comments  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.comgeo.2010.09.005">doi:10.1016/j.comgeo.2010.09.005</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zyvi2g3nlrfnvldlujaxrysiru">fatcat:zyvi2g3nlrfnvldlujaxrysiru</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190414165924/https://core.ac.uk/download/pdf/81932331.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/f2/caf2cc6c79bc38ac29c5ff26d2ab82c18fc9fb81.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.comgeo.2010.09.005"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 1,611 results