DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Arboricity
Arboricity
Linear K-Arboricities on Trees
Orienting Fully Dynamic Graphs with Worst-Case Time Bounds⋆
Faster Sublinear Approximation of the Number of K-Cliques in Low-Arboricity Graphs
On Star and Caterpillar Arboricity
Graph Treewidth and Geometric Thickness Parameters
Decomposition of Sparse Graphs Into Forests and a Graph with Bounded Degree
On the Vertex-Arboricity of Planar Graphs
STRUCTURAL RESULTS on MAXIMAL K-DEGENERATE GRAPHS
On Graph Thickness, Geometric Thickness, and Separator Theorems
A Tutorial on Clique Problems in Communications and Signal Processing Ahmed Douik, Student Member, IEEE, Hayssam Dahrouj, Senior Member, IEEE, Tareq Y
Induced and Weak Induced Arboricities
Arxiv Papers on Random Structures
K-Degenerate Graphs
Arxiv:1907.09994V2 [Math.CO] 9 Aug 2019 (≺, P) Is a Book Embedding If for Any Two Edges Uv and Xy in E We Have
Ordering Heuristics for K-Clique Listing
A Status on the Linear Arboricity J
New Bounds of Arboricity of Graph
K-Connectivity and Decomposition of Graphs Into Forests
Top View
The Arboricity Captures the Complexity of Sampling Edges
In Search of the Densest Subgraph
Distributed Arboricity-Dependent Graph Coloring Via All-To-All Communication
Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures
New Relations Between Thickness and Outer Thickness of a Graph and Its Arboricity -.: Scientific Press International Limited
A Constructive Arboricity Approximation Scheme
The K-Strong Induced Arboricity of a Graph
Distributed Dominating Set Approximations Beyond Planar Graphs
Pseudoforest Partitions and the Approximation of Connected Subgraphs of High Density
Three Ways to Cover a Graph
A Planar Linear Arboricity Conjecture∗
The Geometric Thickness of Low Degree Graphs
Some Results on Incidence Coloring, Star Arboricity and Domination Number
Three Ways to Cover a Graph
LNCS 4372, Pp
Geometric Representations of Graphs with Low Polygonal Complexity
Arxiv:1908.05066V3 [Math.CO] 12 Apr 2021 Elthreshold Real Fetvl Vni Ehv O Ugt Rcial,Ti S This Practically, K Budget
Distributed Arboricity-Dependent Graph Coloring Via All-To-All Communication