The Δ-subgraph GΔ of a simple graph G is the subgraph of G induced by the vertices of maximum degree Δ = Δ(G). We prove a number of results to the effect that if Δ(G) is large and the minimum degree of GΔ is at most one, then G satisfies χ′(G) = Δ(G), where χ′(G) is the edge-chromatic number of G
AbstractFor large values of Δ, it is shown that all Δ-regular finite simple graphs possess a non-tri...
AbstractAnderson and Lipman defined the wreath product and conjectured that the edge-chromatic numbe...
We provide a finite forbidden induced subgraph characterization for the graph class gamma(k), for al...
AbstractThe Δ-subgraph GΔ of a simple graph G is the subgraph of G induced by the vertices of maximu...
AbstractLet G be a graph. The core of G, denoted by GΔ, is the subgraph of G induced by the vertices...
AbstractThe Δ-subgraph of a simple graph G is the subgraph of G induced by the vertices of maximum d...
The Δ-subgraph of a simple graph G is the subgraph of G induced by the vertices of maximum degree Δ ...
AbstractConditions on the subgraph induced by the vertices of maximum degree of a simple graph G are...
By Vizing's theorem, the chromatic index χ′(G) of a simple graph G satisfies Δ(G) ≤ χ′(G) ≤ Δ(G) + 1...
We characterize the simple graphs G which satisfy Δ(G) ≥ |V(G)| – 3 and x'(G) = Δ(G), where x'(G) is...
AbstractLet G be a color-critical graph with χ(G)≥Δ(G)=2t+1≥5 such that the subgraph of G induced by...
AbstractLet G be a simple graph, let Δ(G) denote the maximum degree of its vertices, and let χ(G) de...
AbstractConditions on the subgraph induced by the vertices of maximum degree of a simple graph G are...
AbstractLet G be a graph. The core of G, denoted by GΔ, is the subgraph of G induced by the vertices...
We provide a finite forbidden induced subgraph characterization for the graph class gamma(k), for al...
AbstractFor large values of Δ, it is shown that all Δ-regular finite simple graphs possess a non-tri...
AbstractAnderson and Lipman defined the wreath product and conjectured that the edge-chromatic numbe...
We provide a finite forbidden induced subgraph characterization for the graph class gamma(k), for al...
AbstractThe Δ-subgraph GΔ of a simple graph G is the subgraph of G induced by the vertices of maximu...
AbstractLet G be a graph. The core of G, denoted by GΔ, is the subgraph of G induced by the vertices...
AbstractThe Δ-subgraph of a simple graph G is the subgraph of G induced by the vertices of maximum d...
The Δ-subgraph of a simple graph G is the subgraph of G induced by the vertices of maximum degree Δ ...
AbstractConditions on the subgraph induced by the vertices of maximum degree of a simple graph G are...
By Vizing's theorem, the chromatic index χ′(G) of a simple graph G satisfies Δ(G) ≤ χ′(G) ≤ Δ(G) + 1...
We characterize the simple graphs G which satisfy Δ(G) ≥ |V(G)| – 3 and x'(G) = Δ(G), where x'(G) is...
AbstractLet G be a color-critical graph with χ(G)≥Δ(G)=2t+1≥5 such that the subgraph of G induced by...
AbstractLet G be a simple graph, let Δ(G) denote the maximum degree of its vertices, and let χ(G) de...
AbstractConditions on the subgraph induced by the vertices of maximum degree of a simple graph G are...
AbstractLet G be a graph. The core of G, denoted by GΔ, is the subgraph of G induced by the vertices...
We provide a finite forbidden induced subgraph characterization for the graph class gamma(k), for al...
AbstractFor large values of Δ, it is shown that all Δ-regular finite simple graphs possess a non-tri...
AbstractAnderson and Lipman defined the wreath product and conjectured that the edge-chromatic numbe...
We provide a finite forbidden induced subgraph characterization for the graph class gamma(k), for al...
DOI
Add to ORKG