Local boxicity and maximum degree
نویسندگان
چکیده
The local boxicity of a graph G, denoted by lbox(G), is the minimum positive integer l such that G can be obtained using intersection k (where k≥l) interval graphs where each vertex appears as non-universal in at most these graphs. Let on n vertices having m edges. Δ denote maximum degree G. We show that, lbox(G)≤213log⁎ΔΔ. lbox(G)∈O(nlogn). lbox(G)≤(213log⁎m+2)m. its product dimension. This connection helps us showing Kneser K(n,k) k2loglogn.
منابع مشابه
Boxicity and maximum degree
An axis-parallel d–dimensional box is a Cartesian product R1 × R2 × · · · × Rd where Ri (for 1 ≤ i ≤ d) is a closed interval of the form [ai, bi] on the real line. For a graph G, its boxicity box(G) is the minimum dimension d, such that G is representable as the intersection graph of (axis–parallel) boxes in d–dimensional space. The concept of boxicity finds applications in various areas such a...
متن کاملLocal and union boxicity
The boxicity box(H) of a graph H is the smallest integer d such that H is the intersection of d interval graphs, or equivalently, that H is the intersection graph of axis-aligned boxes in R. These intersection representations can be interpreted as covering representations of the complement H of H with co-interval graphs, that is, complements of interval graphs. We follow the recent framework of...
متن کاملBoxicity of graphs with bounded degree
The boxicity of a graph G = (V,E) is the smallest k for which there exist k interval graphs Gi = (V,Ei), 1 ≤ i ≤ k, such that E = E1 ∩ . . . ∩ Ek. Graphs with boxicity at most d are exactly the intersection graphs of (axis-parallel) boxes in Rd. In this note, we prove that graphs with maximum degree ∆ have boxicity at most ∆2 + 2, which improves the previous bound of 2∆2 obtained by Chandran et...
متن کاملStrong immersions and maximum degree
A graph H is strongly immersed in G if G is obtained from H by a sequence of vertex splittings (i.e., lifting some pairs of incident edges and removing the vertex) and edge removals. Equivalently, vertices of H are mapped to distinct vertices of G (branch vertices) and edges of H are mapped to pairwise edge-disjoint paths in G, each of them joining the branch vertices corresponding to the ends ...
متن کاملVertex arboricity and maximum degree
The vertex arboricity of graph G is the minimum number of colors that can be used to color the vertices of G so that each color class induces an acyclic subgraph of G. We prove results such as this: if a connected graph G is neither a cycle nor a clique, then there is a coloring of V(G/ with at most [-A(G)/2 ~ colors, such that each color class induces a forest and one of those induced forests ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2022
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2022.113085