In this paper, by applying the discharging method, we show that if G is a planar graph with a maximum degree of Δ=6 that does not contain any adjacent 8-cycles, then G is of class 1
AbstractThe Total Coloring Conjecture, in short, TCC, says that every simple graph is (Δ+2)-totally-...
In this paper, we get that G is edge-k-choosable (k=max10,ΔG) for planar graph G without adjacent 7-...
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...
AbstractWe prove that every planar graph G with Δ=6 is of Class 1 if it does not contain a 5-cycle w...
AbstractWe prove that every planar graph G with Δ=6 is of Class 1 if it does not contain a 5-cycle w...
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one othe...
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 well-known conjecture of Vizing (the planar graph conjecture) states that every plane grap...
AbstractIn 1965, Vizing proved that planar graphs of maximum degree at least eight have the edge chr...
It is known that Total Coloring Conjecture (TCC) was verified for planar graphs with maximum degree ...
A total k-coloring of a graph is an assignment of k colors to its vertices and edges such that no tw...
In 1965, Vizing proved that planar graphs of maximum degree at least eight have the edge chromatic n...
In 1965, Vizing proved that planar graphs of maximum degree at least eight have the edge chromatic n...
AbstractThe total chromatic number of a graph G, denoted by χ″(G), is the minimum number of colors n...
AbstractThe Total Coloring Conjecture, in short, TCC, says that every simple graph is (Δ+2)-totally-...
In this paper, we get that G is edge-k-choosable (k=max10,ΔG) for planar graph G without adjacent 7-...
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...
AbstractWe prove that every planar graph G with Δ=6 is of Class 1 if it does not contain a 5-cycle w...
AbstractWe prove that every planar graph G with Δ=6 is of Class 1 if it does not contain a 5-cycle w...
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one othe...
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 well-known conjecture of Vizing (the planar graph conjecture) states that every plane grap...
AbstractIn 1965, Vizing proved that planar graphs of maximum degree at least eight have the edge chr...
It is known that Total Coloring Conjecture (TCC) was verified for planar graphs with maximum degree ...
A total k-coloring of a graph is an assignment of k colors to its vertices and edges such that no tw...
In 1965, Vizing proved that planar graphs of maximum degree at least eight have the edge chromatic n...
In 1965, Vizing proved that planar graphs of maximum degree at least eight have the edge chromatic n...
AbstractThe total chromatic number of a graph G, denoted by χ″(G), is the minimum number of colors n...
AbstractThe Total Coloring Conjecture, in short, TCC, says that every simple graph is (Δ+2)-totally-...
In this paper, we get that G is edge-k-choosable (k=max10,ΔG) for planar graph G without adjacent 7-...
AbstractIt is known that there are class two graphs with Δ=6 which can be embedded in a surface Σ wi...
DOI
Add to ORKG