SIAMDM 2010 - PDF Preprint Papers

SIAMDM 2010

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed SIAMDM-2010 Paper

click to vote

SIAMDM
2010

194views more SIAMDM 2010»

Combinatorics and Geometry of Finite and Infinite Squaregraphs

13 years 7 months ago

Download pageperso.lif.univ-mrs.fr

Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...

Hans-Jürgen Bandelt, Victor Chepoi, David Epp...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	194	Combinatorics and Geometry of Finite and Infinite Squaregraphs	claim
2	170	Complete Minors and Independence Number	claim
3	167	Domination Game and an Imagination Strategy	claim
4	166	Direct Product Factorization of Bipartite Graphs with Bipartition-reversing Involutions	claim
5	149	Formal Theory of Noisy Sensor Network Localization	claim
6	146	Bringing Toric Codes to the Next Dimension	claim
7	140	Retractions to Pseudoforests	claim
8	138	The Last Fraction of a Fractional Conjecture	claim
9	137	Repetition Error Correcting Sets: Explicit Constructions and Prefixing Methods	claim
10	136	Obnoxious Centers in Graphs	claim
11	133	Distinguishing Chromatic Number of Cartesian Products of Graphs	claim
12	133	Drop Cost and Wavelength Optimal Two-Period Grooming with Ratio 4	claim
13	131	On Optimal Strategies for a Hat Game on Graphs	claim
14	130	On the Hull Number of Triangle-Free Graphs	claim
15	128	Permutation Capacities of Families of Oriented Infinite Paths	claim
16	128	t-Perfection Is Always Strong for Claw-Free Graphs	claim
17	123	Large Bichromatic Point Sets Admit Empty Monochromatic 4-Gons	claim
18	119	A Spanning Tree Method for Bounding Hitting Times of Random Walks on Graphs	claim
19	119	Surviving Rates of Graphs with Bounded Treewidth for the Firefighter Problem	claim
20	117	Design is as Easy as Optimization	claim
21	114	Rank-Based Attachment Leads to Power Law Graphs	claim
22	113	The VPN Problem with Concave Costs	claim
23	111	Hopf Structures on the Multiplihedra	claim
24	111	Random Walks with Look-Ahead in Scale-Free Random Graphs	claim
25	110	Embedding Spanning Trees in Random Graphs	claim
26	109	Ends and Vertices of Small Degree in Infinite Minimally k-(Edge)-Connected Graphs	claim
27	108	A More Relaxed Model for Graph-Based Data Clustering: s-Plex Cluster Editing	claim
28	106	An Extension of the Nemhauser--Trotter Theorem to Generalized Vertex Cover with Applications	claim
29	105	Minimal Inequalities for an Infinite Relaxation of Integer Programs	claim
30	105	On the Relative Generalized Hamming Weights of Linear Codes and their Subcodes	claim
31	105	A Lower Bound on the Transposition Diameter	claim
32	105	The Brunn--Minkowski Inequality and Nontrivial Cycles in the Discrete Torus	claim
33	103	A Semiexact Degree Condition for Hamilton Cycles in Digraphs	claim
34	102	Hamilton Cycles in Random Graphs with a Fixed Degree Sequence	claim
35	102	The Balanced Decomposition Number and Vertex Connectivity	claim
36	101	Combinatorics and Genus of Tropical Intersections and Ehrhart Theory	claim
37	101	Vision-Based Pursuit-Evasion in a Grid	claim
38	101	Rationality and Strongly Polynomial Solvability of Eisenberg--Gale Markets with Two Agents	claim
39	99	Reductions of Young Tableau Bijections	claim
40	99	Edge-Injective and Edge-Surjective Vertex Labellings	claim
41	99	On the Stable Paths Problem	claim
42	96	Note on Bipartite Graph Tilings	claim
43	95	Short Cycle Covers of Graphs with Minimum Degree Three	claim
44	95	Voting Paths	claim
45	95	Flips in Graphs	claim
46	93	Thomassen's Choosability Argument Revisited	claim
47	92	1-Saturating Sets, Caps, and Doubling-Critical Sets in Binary Spaces	claim
48	92	On Face Vectors of Barycentric Subdivisions of Manifolds	claim
49	92	The Limit Shape of Large Alternating Sign Matrices	claim
50	91	Resilient Pancyclicity of Random and Pseudorandom Graphs	claim
51	91	Embedding into Bipartite Graphs	claim
52	90	A Construction of Infinite Sets of Intertwines for Pairs of Matroids	claim
53	89	Edge-Connectivity, Eigenvalues, and Matchings in Regular Graphs	claim
54	89	Routing Numbers of Cycles, Complete Bipartite Graphs, and Hypercubes	claim
55	87	Set Systems without a Strong Simplex	claim
56	87	On 3-Hypergraphs with Forbidden 4-Vertex Configurations	claim
57	84	On Computing the Frequencies of Induced Subhypergraphs	claim
58	84	Complementary Iterated Floor Words and the Flora Game	claim
59	75	An Efficient Sparse Regularity Concept	claim
60	74	Dominating Subsets under Projections	claim
61	64	Mixed Statistics on 01-Fillings of Moon Polyominoes	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers