Results 41 to 50 of about 1,379,637 (289)
Tuza's Conjecture for Threshold Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 Tuza famously conjectured in 1981 that in a graph without k+1 edge-disjoint triangles, it suffices to delete at most 2k edges to obtain a triangle-free graph. The conjecture holds for graphs with small treewidth or small maximum average degree, including
Marthe Bonamy +6 more
doaj +1 more source
Refined Vertex Sparsifiers of Planar Graphs [PDF]
SIAM Journal on Discrete Mathematics, 2017 We study the following version of cut sparsification. Given a large edge-weighted network $G$ with $k$ terminal vertices, compress it into a smaller network $H$ with the same terminals, such that every minimum terminal cut in $H$ approximates the ...
Robert Krauthgamer, Inbal Rika
semanticscholar +1 more source
On edge-intersection graphs of k-bend paths in grids [PDF]
Discrete Mathematics & Theoretical Computer Science, 2010 Edge-intersection graphs of paths in grids are graphs that can be represented such that vertices are paths in a grid and edges between vertices of the graph exist whenever two grid paths share a grid edge. This type of graphs is motivated by applications
Therese Biedl, Michal Stern
doaj +1 more source
Distributed Dominating Set Approximations beyond Planar Graphs [PDF]
ACM Trans. Algorithms, 2017 The Minimum Dominating Set (MDS) problem is a fundamental and challenging problem in distributed computing. While it is well known that minimum dominating sets cannot be well approximated locally on general graphs, in recent years there has been much ...
S. A. Amiri, S. Schmid, S. Siebertz
semanticscholar +1 more source
AxiomsWe define biequivalent planar graphs, which are a generalisation of the uniform polyhedron graphs, as planar graphs made out of two families of equivalent nodes.
Bernard Piette
doaj +1 more source
Intractability of Optimal Multirobot Path Planning on Planar Graphs [PDF]
IEEE Robotics and Automation Letters, 2015 We study the computational complexity of optimally solving multirobot path planning problems on planar graphs. For four common time- and distance-based objectives, we show that the associated path optimization problems for multiple robots are all NP ...
Jingjin Yu
semanticscholar +1 more source
Non-planar one-loop Parke-Taylor factors in the CHY approach for quadratic propagators
Journal of High Energy Physics, 2018 In this work we have studied the Kleiss-Kuijf relations for the recently introduced Parke-Taylor factors at one-loop in the CHY approach, that reproduce quadratic Feynman propagators.
Naser Ahmadiniaz +2 more
doaj +1 more source
The Planar Index and Outerplanar Index of Some Graphs Associated to Commutative Rings
Discussiones Mathematicae - General Algebra and Applications, 2019 In this paper, we study the planar and outerplanar indices of some graphs associated to a commutative ring. We give a full characterization of these graphs with respect to their planar and outerplanar indices when R is a finite ring.
Barati Zahra, Afkhami Mojgan
doaj +1 more source
About Structure of Graph Obstructions for Klein Surface with 9 Vertices
Кібернетика та комп'ютерні технології, 2020 The structure of the 9 vertex obstructive graphs for the nonorientable surface of the genus 2 is established by the method of (-transformations of the graphs.
V.I. Petrenjuk, D.A. Petrenjuk
doaj +1 more source
Statistics of Feynman amplitudes in ϕ 4-theory
Journal of High Energy Physics, 2023 The amplitude of subdivergence-free logarithmically divergent Feynman graphs in ϕ 4-theory in 4 spacetime dimensions is given by a single number, the Feynman period. We numerically compute the periods of 1.3 million completed graphs, this represents more
Paul-Hermann Balduf
doaj +1 more source