DOIAbstract
AbstractWe prove that every planar graph G with Δ=6 is of Class 1 if it does not contain a 5-cycle with a chord
AbstractWe prove that every planar graph G with Δ=6 is of Class 1 if it does not contain a 5-cycle with a chord
A graph is called 1-planar if it can be drawn in the plane so that each edge is crossed by at most o...
AbstractA graph is 1-planar if it can be drawn on the plane so that each edge is crossed by no more ...
AbstractA well-known conjecture of Vizing (the planar graph conjecture) states that every plane grap...
AbstractWe prove that every planar graph G with Δ=6 is of Class 1 if it does not contain a 5-cycle w...
In this paper, by applying the discharging method, we show that if G is a planar graph with a maximu...
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one othe...
AbstractIt is known that there are class two graphs with Δ=6 which can be embedded in a surface Σ wi...
AbstractA well-known conjecture of Vizing (the planar graph conjecture) states that every plane grap...
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one othe...
AbstractA graph is said to be of class I if its chromatic index is equal to the maximum of degree of...
AbstractLet G be a graph. The core of G, denoted by GΔ, is the subgraph of G induced by the vertices...
A graph is 1-planar if it can be embedded in the plane so that each edge is crossed by at most one o...
AbstractA graph is called 1-planar if it can be drawn in the plane so that each its edge is crossed ...
AbstractLet G be a graph. The core of G, denoted by GΔ, is the subgraph of G induced by the vertices...
Abstract. A graph is called 1-planar if it can be drawn on the plane so that each edge is crossed by...
A graph is called 1-planar if it can be drawn in the plane so that each edge is crossed by at most o...
AbstractA graph is 1-planar if it can be drawn on the plane so that each edge is crossed by no more ...
AbstractA well-known conjecture of Vizing (the planar graph conjecture) states that every plane grap...
AbstractWe prove that every planar graph G with Δ=6 is of Class 1 if it does not contain a 5-cycle w...
In this paper, by applying the discharging method, we show that if G is a planar graph with a maximu...
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one othe...
AbstractIt is known that there are class two graphs with Δ=6 which can be embedded in a surface Σ wi...
AbstractA well-known conjecture of Vizing (the planar graph conjecture) states that every plane grap...
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one othe...
AbstractA graph is said to be of class I if its chromatic index is equal to the maximum of degree of...
AbstractLet G be a graph. The core of G, denoted by GΔ, is the subgraph of G induced by the vertices...
A graph is 1-planar if it can be embedded in the plane so that each edge is crossed by at most one o...
AbstractA graph is called 1-planar if it can be drawn in the plane so that each its edge is crossed ...
AbstractLet G be a graph. The core of G, denoted by GΔ, is the subgraph of G induced by the vertices...
Abstract. A graph is called 1-planar if it can be drawn on the plane so that each edge is crossed by...
A graph is called 1-planar if it can be drawn in the plane so that each edge is crossed by at most o...
AbstractA graph is 1-planar if it can be drawn on the plane so that each edge is crossed by no more ...
AbstractA well-known conjecture of Vizing (the planar graph conjecture) states that every plane grap...
Add to ORKG