AbstractConditions on the subgraph induced by the vertices of maximum degree of a simple graph G are found which are sufficient for G to be class 1. These conditions can be used to generalize a result of Fournier. An efficient algorithm is described for deciding whether or not a particular graph satisfies the conditions
We provide a finite forbidden induced subgraph characterization for the graph class gamma(k), for al...
We provide a finite forbidden induced subgraph characterization for the graph class gamma(k), for al...
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one othe...
AbstractConditions on the subgraph induced by the vertices of maximum degree of a simple graph G are...
The Δ-subgraph GΔ of a simple graph G is the subgraph of G induced by the vertices of maximum degree...
AbstractLet G be a graph. The core of G, denoted by GΔ, is the subgraph of G induced by the vertices...
AbstractThe Δ-subgraph GΔ of a simple graph G is the subgraph of G induced by the vertices of maximu...
AbstractFor various graph-theoretic properties P that impose upper bounds on the minimum degree or t...
By Vizing's theorem, the chromatic index χ′(G) of a simple graph G satisfies Δ(G) ≤ χ′(G) ≤ Δ(G) + 1...
AbstractLet G and H be two simple graphs on p vertices. We give a sufficient condition, based on the...
AbstractIn this paper, we give sufficient conditions for simple graphs to be class 1. These conditio...
AbstractLet G be a graph. The core of G, denoted by GΔ, is the subgraph of G induced by the vertices...
Consider graphs that are embeddable in a surface of characteristic zero. Class two graphs of this ty...
A petal graph is a connected graph G with maximum degree three, minimum degree two, and such that th...
AbstractWe prove that every planar graph G with Δ=6 is of Class 1 if it does not contain a 5-cycle w...
We provide a finite forbidden induced subgraph characterization for the graph class gamma(k), for al...
We provide a finite forbidden induced subgraph characterization for the graph class gamma(k), for al...
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one othe...
AbstractConditions on the subgraph induced by the vertices of maximum degree of a simple graph G are...
The Δ-subgraph GΔ of a simple graph G is the subgraph of G induced by the vertices of maximum degree...
AbstractLet G be a graph. The core of G, denoted by GΔ, is the subgraph of G induced by the vertices...
AbstractThe Δ-subgraph GΔ of a simple graph G is the subgraph of G induced by the vertices of maximu...
AbstractFor various graph-theoretic properties P that impose upper bounds on the minimum degree or t...
By Vizing's theorem, the chromatic index χ′(G) of a simple graph G satisfies Δ(G) ≤ χ′(G) ≤ Δ(G) + 1...
AbstractLet G and H be two simple graphs on p vertices. We give a sufficient condition, based on the...
AbstractIn this paper, we give sufficient conditions for simple graphs to be class 1. These conditio...
AbstractLet G be a graph. The core of G, denoted by GΔ, is the subgraph of G induced by the vertices...
Consider graphs that are embeddable in a surface of characteristic zero. Class two graphs of this ty...
A petal graph is a connected graph G with maximum degree three, minimum degree two, and such that th...
AbstractWe prove that every planar graph G with Δ=6 is of Class 1 if it does not contain a 5-cycle w...
We provide a finite forbidden induced subgraph characterization for the graph class gamma(k), for al...
We provide a finite forbidden induced subgraph characterization for the graph class gamma(k), for al...
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one othe...
DOI
Add to ORKG