Discharging method (discrete mathematics)

The discharging method is a technique used to prove lemmas in structural graph theory. Discharging is most well known for its central role in the… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1999-2016
02419992016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
An identifying code in a graph G is a subset of vertices with the property that for each vertex v ∈ V (G), the collection of… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2015
2015
Future large-scale deployment of plug-in hybrid electric vehicles (PHEVs) will render massive energy demand on the electric grid… (More)
  • figure 1
  • figure 2
  • table I
  • figure 3
  • figure 4
Is this relevant?
2014
2014
  • 2014
Future large-scale deployment of plug-in hybrid electric vehicles (PHEVs) will render massive energy demand on the electric grid… (More)
  • figure 1
  • figure 2
  • table I
  • figure 3
  • figure 4
Is this relevant?
2013
2013
This study explored Through Glass Via (TGV) Formation Technology by using Focused Electrical Discharging Method for alkali-fee… (More)
  • table 1
  • figure 1
  • table 2
  • figure 3
  • figure 2
Is this relevant?
2010
2010
it is shown that each triangle-free 1-planar graph with maximum degree $\Delta\geq7$ can be $\Delta$-colorable by Discharging… (More)
Is this relevant?
Highly Cited
2007
Highly Cited
2007
  • FOUR COLORABLE
  • 2007
As has become standard, the four color map problem will be considered in the dual sense as the problem of whether the vertices of… (More)
Is this relevant?
2004
2004
Charge equalization during the charging process has been extensively discussed for a series-connected battery bank. However… (More)
  • figure I
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
2001
2001
It is shown that the discharging method can be successfully applied on infinite planar graphs of subexponential growth and even… (More)
  • figure 1
  • figure 2
Is this relevant?
1999
1999
Given a graphG, a total k-coloring ofG is a simultaneous coloring of the vertices and edges ofGwith at most k colors. If ∆(G) is… (More)
Is this relevant?