AbstractWe prove that for any connected graph G and any integer r which is a common multiple of the degrees of the vertices in G, there exists a connected, r-regular, and G-decomposable graph H such that χ(H) = χ(G) and ω(H) = ω(G), where χ and ω are the chromatic number and the clique number, respectively. Also we give a bound for the minimum order among all such graphs
For given positive integer n ≥ 4, let Cn, Kn and L(Kn) respectively denote a cycle with n edges, a c...
summary:For an ordered $k$-decomposition $\mathcal D = \lbrace G_1, G_2,\dots , G_k\rbrace $ of a co...
THE SPECIAL CHARACTERS IN THIS ABSTRACT CANNOT BE DISPLAYED CORRECTLY ON THIS PAGE. PLEASE REFER TO ...
AbstractWe prove that for any connected graph G and any integer r which is a common multiple of the ...
AbstractA graph H is G-decomposable if it contains subgraphs G1,…,Gh,h⩾2, isomorphic to G whose sets...
AbstractA graph H decomposes a graph G if and only if the edges of G can be partitioned into disjoin...
International audienceThe well-known 1-2-3 Conjecture asserts that the edges of every graph without ...
AbstractA. Frank (Problem session of the Fifth British Combinatorial Conference, Aberdeen, Scotland,...
AbstractDecompositions of a graph by clique separators are investigated which have the additional pr...
The main objective of this thesis is to review and expand the study of graph decomposability. An H-d...
AbstractLet T be any tree of order d≥1. We prove that every connected graph G with minimum degree d ...
AbstractFor any simple graph G, Vizing's Theorem [5] implies that Δ(G) ⩽ χ(G) ⩽ Δ(G) + 1, where Δ(G)...
AbstractIn a landmark paper, Erdős et al. (1991) [3] proved that if G is a complete graph whose edge...
AbstractAnswering a problem of Erdős it is proved that for every n ≠ 3, 7, 9 there exists a ...
AbstractThe path number p(G) of a graph G is the minimum number of paths needed to partition the edg...
For given positive integer n ≥ 4, let Cn, Kn and L(Kn) respectively denote a cycle with n edges, a c...
summary:For an ordered $k$-decomposition $\mathcal D = \lbrace G_1, G_2,\dots , G_k\rbrace $ of a co...
THE SPECIAL CHARACTERS IN THIS ABSTRACT CANNOT BE DISPLAYED CORRECTLY ON THIS PAGE. PLEASE REFER TO ...
AbstractWe prove that for any connected graph G and any integer r which is a common multiple of the ...
AbstractA graph H is G-decomposable if it contains subgraphs G1,…,Gh,h⩾2, isomorphic to G whose sets...
AbstractA graph H decomposes a graph G if and only if the edges of G can be partitioned into disjoin...
International audienceThe well-known 1-2-3 Conjecture asserts that the edges of every graph without ...
AbstractA. Frank (Problem session of the Fifth British Combinatorial Conference, Aberdeen, Scotland,...
AbstractDecompositions of a graph by clique separators are investigated which have the additional pr...
The main objective of this thesis is to review and expand the study of graph decomposability. An H-d...
AbstractLet T be any tree of order d≥1. We prove that every connected graph G with minimum degree d ...
AbstractFor any simple graph G, Vizing's Theorem [5] implies that Δ(G) ⩽ χ(G) ⩽ Δ(G) + 1, where Δ(G)...
AbstractIn a landmark paper, Erdős et al. (1991) [3] proved that if G is a complete graph whose edge...
AbstractAnswering a problem of Erdős it is proved that for every n ≠ 3, 7, 9 there exists a ...
AbstractThe path number p(G) of a graph G is the minimum number of paths needed to partition the edg...
For given positive integer n ≥ 4, let Cn, Kn and L(Kn) respectively denote a cycle with n edges, a c...
summary:For an ordered $k$-decomposition $\mathcal D = \lbrace G_1, G_2,\dots , G_k\rbrace $ of a co...
THE SPECIAL CHARACTERS IN THIS ABSTRACT CANNOT BE DISPLAYED CORRECTLY ON THIS PAGE. PLEASE REFER TO ...
DOI
Add to ORKG