Filters








218 Hits in 4.5 sec

Locally grid graphs: classification and Tutte uniqueness

A. Márquez, A. de Mier, M. Noy, M.P. Revuelta
<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;
Secondly, as a continuation of the research initiated in (On graphs determined by their Tutte polynomials, Graphs Combin., to appear), we prove that Cp × Cq is uniquely determined by its Tutte polynomial  ...  We deÿne a locally grid graph as a graph in which the structure around each vertex is a 3 × 3 grid , the canonical examples being the toroidal grids Cp × Cq. The paper contains two main results.  ...  grid graph.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0012-365x(02)00818-x">doi:10.1016/s0012-365x(02)00818-x</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/yfn3clslizdrvjbacfquwg4zxm">fatcat:yfn3clslizdrvjbacfquwg4zxm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190305091633/https://core.ac.uk/download/pdf/82649213.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/2a/5f/2a5f40bc37c42748df9ac28e7f57d0ee6ab6b727.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(02)00818-x"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Finite 2-distance transitive graphs [article]

Brian P. Corr, Wei Jin, Csaba Schneider
<span title="2015-07-03">2015</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
This paper investigates the family of (G,2)-distance transitive graphs that are not (G,2)-arc transitive. Our main result is the classification of such graphs of valency not greater than 5.  ...  A non-complete graph Γ is said to be (G,2)-distance transitive if G is a subgroup of the automorphism group of Γ that is transitive on the vertex set of Γ, and for any vertex u of Γ, the stabilizer G_u  ...  If the valency and the girth are both equal to 3, then Γ = K 4 . Hence Theorem 1.3 follows from Proposition 5.1, in the case of girth 4, and from Proposition 5.2 in the case of girth 4.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1507.01027v1">arXiv:1507.01027v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/qjf725u5u5fa7o4az7ofcnexf4">fatcat:qjf725u5u5fa7o4az7ofcnexf4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191020094044/https://arxiv.org/pdf/1507.01027v1.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/f8/b1/f8b12e03c246ebbf6d3c1e1e1af141e72551f6ee.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1507.01027v1" 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>

On k-connected-homogeneous graphs [article]

Alice Devillers, Joanna B. Fawcett, Cheryl E. Praeger, Jin-Xin Zhou
<span title="2019-09-26">2019</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Locally finite, locally connected graphs often fail to be 4-CH because of a combinatorial obstruction called the unique x property; we prove that this property holds for locally strongly regular graphs  ...  We also classify the locally finite, locally disconnected 4-CH graphs containing 3-cycles and induced 4-cycles, and prove that, with the possible exception of locally disconnected graphs containing 3-cycles  ...  Locally the grid graph or its complement.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1805.03115v2">arXiv:1805.03115v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/rqifpkz4qbcenetg7kzdufmudy">fatcat:rqifpkz4qbcenetg7kzdufmudy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200831230523/https://arxiv.org/pdf/1805.03115v2.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/4a/af/4aaf21e6d37270c20b7307d78247c92db8de5483.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1805.03115v2" 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>

Detecting and Counting Small Subgraphs, and Evaluating a Parameterized Tutte Polynomial: Lower Bounds via Toroidal Grids and Cayley Graph Expanders [article]

Marc Roth, Johannes Schmitt, Philip Wellnitz
<span title="2021-04-29">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
As a main technical result, we gain a complete understanding of the coefficients of toroidal grids and selected Cayley graph expanders in the homomorphism basis of #𝙴𝚍𝚐𝚎𝚂𝚞𝚋(Φ).  ...  Our methods can also be applied to a parameterized variant of the Tutte Polynomial T^k_G of a graph G, to which many known combinatorial interpretations of values of the (classical) Tutte Polynomial can  ...  Acknowledgements We thank Alina Vdovina and Norbert Peyerimhoff for explaining their construction of 2-group Cayley graph expanders [65] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2011.03433v2">arXiv:2011.03433v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7aauf7xejvfx5atw3n7s6sefsa">fatcat:7aauf7xejvfx5atw3n7s6sefsa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210505215412/https://arxiv.org/pdf/2011.03433v2.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/c9/df/c9dff5bd2f2214b279be9780570d21281ff2e468.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2011.03433v2" 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>

Visualizing large graphs

Yifan Hu, Lei Shi
<span title="2015-01-12">2015</span> <i title="Wiley"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/wyh4gp6flzcdnfzrcgsmkp4duu" style="color: black;">Wiley Interdisciplinary Reviews: Computational Statistics</a> </i> &nbsp;
With the prevailence of big data, there is a growing need for algorithms and techniques for visualizing very large and complex graphs.  ...  Throughout the paper we use the terms network and graph interchangably. A graph is traditionally visualized as a node-link diagram like Fig. 1 .  ...  Fruchterman and Reingold [30] proposed to reduce the complexity by partitioning the space into grid cells, and only calculated repulsive forces for vertices in neighboring grid cells.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/wics.1343">doi:10.1002/wics.1343</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/j4mg4hizwfbs3ky67j6d67uiqq">fatcat:j4mg4hizwfbs3ky67j6d67uiqq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20151123073534/http://yifanhu.net:80/PUB/large_graph_wires.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/19/61/1961e7a565bde31d9551f4613be95a03279e8620.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/wics.1343"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> wiley.com </button> </a>

Coloring-flow duality of embedded graphs

Matt DeVos, Luis Goddyn, Bojan Mohar, Dirk Vertigan, Xuding Zhu
<span title="2004-08-11">2004</span> <i title="American Mathematical Society (AMS)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/w3g32txdvneltemssag5nwfxcy" style="color: black;">Transactions of the American Mathematical Society</a> </i> &nbsp;
We define the circular chromatic number and the local circular chromatic number of G by χ c (G) = inf{α ∈ R | G has an α-tension} and χ loc (G) = inf{α ∈ R | G has a local α-tension}, respectively.  ...  As an application of the main result we show that such 'bimodal' behavior can be observed in χ loc , and thus in χ c for two generic classes of embedded graphs: those that are triangulations and those  ...  For example, the unique graph G embedded on the Klein bottle consisting of one vertex and two one-sided loops has χ loc (G) = 2.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1090/s0002-9947-04-03544-5">doi:10.1090/s0002-9947-04-03544-5</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5c6ykx4synf65iarm4ipd6zbuy">fatcat:5c6ykx4synf65iarm4ipd6zbuy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200812022600/https://www.ams.org/journals/tran/2005-357-10/S0002-9947-04-03544-5/S0002-9947-04-03544-5.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/4e/1c/4e1c109e124cfa013a277372dfffac1b58edd40d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1090/s0002-9947-04-03544-5"> <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>

Algorithms for drawing graphs: an annotated bibliography

Giuseppe Di Battista, Peter Eades, Roberto Tamassia, Ioannis G Tollis
<span title="">1994</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/is2k7576zbherpepqy3y7zkzuy" style="color: black;">Computational geometry</a> </i> &nbsp;
Several data presentation problems involve drawing graphs so that they are easy to read and understand. Examples include circuit schematics and software engineering diagrams.  ...  In this paper we present a bibliographic survey on algorithms whose goal is to produce aesthetically pleasing drawings of graphs.  ...  Acknowledgements The authors wish to thank the many graph drawers who have pointed out errors and omissions in the first three versions, and those who have helped with updates to create this fourth version  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0925-7721(94)00014-x">doi:10.1016/0925-7721(94)00014-x</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/rwudrni2evgkle42lecplbjhle">fatcat:rwudrni2evgkle42lecplbjhle</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170927022251/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/49b/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS8wOTI1NzcyMTk0MDAwMTR4.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/0a/6c/0a6caf1209c7824b400064ba019bbc1ec492336c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0925-7721(94)00014-x"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Learning-Based Approaches for Graph Problems: A Survey [article]

Kai Siong Yow, Siqiang Luo
<span title="2022-04-17">2022</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Some famous examples include graph colouring, travelling salesman problem and subgraph isomorphism.  ...  We discuss the overview of each framework, and provide analyses based on the design and performance of the framework. Some potential research questions are also suggested.  ...  [33] proposed a unique combination of graph embedding and reinforcement learning framework S2V-DQN, which can be applied on and learned a variety of graph problems.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2204.01057v2">arXiv:2204.01057v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6oinpd56njcu5ait43327r6ege">fatcat:6oinpd56njcu5ait43327r6ege</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220422095108/https://arxiv.org/pdf/2204.01057v2.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/25/4a/254abac8ec2e31d979f84a4e31793f19eb0ac7b9.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2204.01057v2" 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>

On the Structure of the Graph of Unique Symmetric Base Exchanges of Bispanning Graphs [article]

Timo Bingmann
<span title="2016-05-11">2016</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
In this thesis, we discuss the structure of the graph of unique symmetric edge exchanges, and the open question whether these are connected for all bispanning graphs.  ...  For bispanning graphs with vertex-connectivity two, we show that the bispanning graph is the 2-clique sum of two smaller bispanning graphs, and that the unique exchange graph can be built by joining their  ...  at most four vertices. used vertex partitions to separate the graph, while Tutte uses edge cuts.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1601.03526v3">arXiv:1601.03526v3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/42buu5ux7jdilf2zaycnpe5vdu">fatcat:42buu5ux7jdilf2zaycnpe5vdu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200914130215/https://arxiv.org/pdf/1601.03526v3.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/db/71/db71e4a67f32ecdd8394e85038e5cbbb018cf6b3.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1601.03526v3" 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>

A survey of repositories in graph theory [article]

Srinibas Swain, C. Paul Bonnington, Graham Farr, Kerri Morgan
<span title="2020-06-23">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
This survey reviews many of these graph repositories and summarises the scope and contents of each repository.  ...  Foster in the 1930s, many graph repositories have been created to support research in graph theory.  ...  Acknowledgement The authors would like to thank Charles Colbourn, Marston Conder, and Brendan McKay for their comments on earlier versions of this paper.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2006.12741v1">arXiv:2006.12741v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/uxzb3xfahbesbdhgynn3y7kugu">fatcat:uxzb3xfahbesbdhgynn3y7kugu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200625034912/https://arxiv.org/pdf/2006.12741v1.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/81/0f/810f61d4096bc127cb626460acffcbedeac12a11.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2006.12741v1" 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>

Finite two-distance-transitive graphs of valency 6

Wei Jin, Li Tan
<span title="2015-08-18">2015</span> <i title="University of Primorska Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/gvgtrk4iyvatbibvfwr3uifrji" style="color: black;">Ars Mathematica Contemporanea</a> </i> &nbsp;
A non-complete graph Γ is said to be (G, 2)-distance-transitive if, for i = 1, 2 and for any two vertex pairs ( .  ...  This paper classifies the family of (G, 2)-distancetransitive graphs of valency 6 which are not (G, 2)-arc-transitive.  ...  These two graphs are locally isomorphic to 2K 3 and |Γ 2 (u)| = 18.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.26493/1855-3974.781.d31">doi:10.26493/1855-3974.781.d31</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/yix6e4rmcvesjc2kkoqbajxu5y">fatcat:yix6e4rmcvesjc2kkoqbajxu5y</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170705055000/http://amc-journal.eu/index.php/amc/article/download/781/842/" 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/df/d7/dfd7d88153a45c675dd36f3d4e681a1583b437ee.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.26493/1855-3974.781.d31"> <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>

Shortest path embeddings of graphs on surfaces [article]

Alfredo Hubard, Vojtěch Kaluža, Arnaud de Mesmay, Martin Tancer
<span title="2017-08-28">2017</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We observe that the round metrics on the sphere and the projective plane have this property. We provide flat metrics on the torus and the Klein bottle which also have this property.  ...  In this setting, we require that every edge is drawn as a shortest path between its two endpoints and we call an embedding with this property a shortest path embedding.  ...  We also thank Sergio Cabello, Francis Lazarus, Bojan Mohar, Eric Sedgwick, Uli Wagner and the anonymous referees for helpful remarks, and Xavier Goaoc for organizing the workshop that led to this work.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1602.06778v3">arXiv:1602.06778v3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hytyrd3eezcklc2b5i65n4unxi">fatcat:hytyrd3eezcklc2b5i65n4unxi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200823025312/https://arxiv.org/pdf/1602.06778v3.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/c5/16/c51631a1ecac4468bef8ba69c6f8a684d84fd6b6.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1602.06778v3" 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>

Regular colored graphs of positive degree [article]

Razvan Gurau, Gilles Schaeffer
<span title="2016-02-01">2016</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We analyse the structure of regular colored graphs of fixed positive degree and perform their exact and asymptotic enumeration.  ...  Regular colored graphs are dual representations of pure colored D-dimensional complexes.  ...  Stephane Dartois and Vincent Rivasseau are also thanked for interesting discussions on the topic of this paper and the related [4] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1307.5279v3">arXiv:1307.5279v3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/x4xjywvyprhrvohujv5div7s34">fatcat:x4xjywvyprhrvohujv5div7s34</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200826214900/https://arxiv.org/pdf/1307.5279v3.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/0a/a9/0aa936ae272ead9b1855564050bf890eed527214.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1307.5279v3" 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>

Friends and Strangers Walking on Graphs [article]

Colin Defant, Noah Kravitz
<span title="2021-06-15">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Given graphs X and Y with vertex sets V(X) and V(Y) of the same cardinality, we define a graph 𝖥𝖲(X,Y) whose vertex set consists of all bijections σ:V(X)→ V(Y), where two bijections σ and σ' are adjacent  ...  We then derive various necessary and/or sufficient conditions on the graphs X and Y that guarantee the connectedness of 𝖥𝖲(X,Y). Finally, we raise several promising further questions.  ...  We are especially grateful to the referee who outlined their own very detailed alternative view on friends-and-strangers graphs.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2009.05040v2">arXiv:2009.05040v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/alwish3cfvgo5lqvlyzmkkrsna">fatcat:alwish3cfvgo5lqvlyzmkkrsna</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210617145458/https://arxiv.org/pdf/2009.05040v2.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/09/8d/098d321981faf11343609099af87f968550af016.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2009.05040v2" 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>

10 Reasons to Get Interested in Graph Drawing [chapter]

Carla Binucci, Ulrik Brandes, Tim Dwyer, Martin Gronemann, Reinhard von Hanxleden, Marc van Kreveld, Petra Mutzel, Marcus Schaefer, Falk Schreiber, Bettina Speckmann
<span title="">2019</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;
It encompasses basic research such as graph theory, complexity theory, data structures, and graph algorithms as well as applied research such as software libraries, implementations, and applications.  ...  A selection of results demonstrates the influence of graph drawing on other areas and vice versa.  ...  The area requirement of a graph is the size of the integer grid needed to embed the graph so that all vertices lie on grid points.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-91908-9_6">doi:10.1007/978-3-319-91908-9_6</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wchqxlk4fbfqdmhdjhhks74joe">fatcat:wchqxlk4fbfqdmhdjhhks74joe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191217010034/https://link.springer.com/content/pdf/10.1007%2F978-3-319-91908-9_6.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/c2/15/c215987a7815846e68682b765b85154484c743af.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-319-91908-9_6"> <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 218 results