Explicit π-vertex graphs with maximum degree πΎ and diameter [1+π(1)]logπΎ-1 π for each πΎ-1 a prime power
Abstract
References
Index Terms
- Explicit π-vertex graphs with maximum degree πΎ and diameter [1+π(1)]logπΎ-1 π for each πΎ-1 a prime power
Recommendations
On acyclic edge-coloring of the complete bipartite graphs K 2 p - 1 , 2 p - 1 for odd prime p
An acyclic edge-coloring of a graph is a proper edge-coloring without bichromatic (2-colored) cycles. The acyclic chromatic index of a graph G , denoted by a ' ( G ) , is the least integer k such that G admits an acyclic edge-coloring using k colors. ...
(k,1)-coloring of sparse graphs
A graph G is (k,1)-colorable if the vertex set of G can be partitioned into subsets V"1 and V"2 such that the graph G[V"1] induced by the vertices of V"1 has maximum degree at most k and the graph G[V"2] induced by the vertices of V"2 has maximum degree ...
The Vertex Arboricity of 1-Planar Graphs
AbstractThe vertex arboricity a(G) of a graph G is the minimum number of colors required to color the vertices of G such that no cycle is monochromatic. A graph G is 1-planar if it can be drawn in the plane so that each edge has at most one crossing. In ...
Comments
Information & Contributors
Information
Published In

Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
Acceptance Rates
Upcoming Conference
- Sponsor:
- sigact
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 143Total Downloads
- Downloads (Last 12 months)4
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in