Abstract The Internet of Things (IoT) has emerged as one of the growing fields in digital
technology over the past decade. A primary goal of IoT is to connect physical objects to the …

This paper delves into one of the problems within the class known as Multi-Interface
Networks, specifically studying Coverage in Multi-Interface Networks. This class of problems …

A k-edge-coloring of a (n undirected) graph is an assignment of one of k possible colors to
each of the edges of the graph such that different colors are assigned to any two adjacent …

Let G be a graph with a given red-blue coloring c of the edges of G. An ascending Ramsey
sequence in G with respect to c is a sequence G 1, G 2,…, G k of pairwise edge-disjoint …

A graph H is p-edge colorable if there is a coloring ψ: E (H)→{1, 2,⋯, p}, such that for distinct
uv, vw∈ E (H), we have ψ (uv)≠ ψ (vw). The Maximum Edge-Colorable Subgraph problem …

Let G be a graph and k be a positive integer, and let Kc (G, k) denote the number of Kempe
equivalence classes for the k-colorings of G. In 2006, Mohar noted that Kc (G, k)= 1 if G is …

Given a non-trivial graph G, the minimum cardinality of a set of edges F in G such that
χ′(G∖ F)< χ′(G) is called the chromatic edge stability index of G, denoted by es χ′(G) …

Subcubic planar graphs of girth 7 are class I - ScienceDirect Skip to main contentSkip to article
Elsevier logo Journals & Books Help Search My account Sign in View PDF Download full issue …

A $ c $-crossing-critical graph is one that has crossing number at least $ c $ but each of its
proper subgraphs has crossing number less than $ c $. Recently, a set of explicit …

A total matching of a graph G=(V, E) is a subset of G such that its elements, ie vertices and
edges, are pairwise not adjacent. In this context, the Total Matching Problem calls for a total …