Journal article Open Access

On the König deficiency of zero-reducible graphs

Miklós Bartha; Miklós Krész

Dublin Core Export

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc="" xmlns:oai_dc="" xmlns:xsi="" xsi:schemaLocation="">
  <dc:creator>Miklós Bartha</dc:creator>
  <dc:creator>Miklós Krész</dc:creator>
  <dc:description>A confluent and terminating reduction system is introduced for graphs,which preserves the number of their perfect matchings. A union-find algorithm is presented to carry out reduction in almost linear time. The König property is investigated in the context of reduction by introducing the König deficiency of a graph G as the difference between the vertex covering number and thematching number ofG. It is shown that the problem of finding the König deficiency of a graph is NP-complete even if we know that the graph reduces to the empty graph. Finally, the König deficiency of graphs G having a vertex v such that G − v has a unique perfect matching is studied in connection with reduction.</dc:description>
  <dc:source>Journal of Combinatorial Optimization</dc:source>
  <dc:subject>Graph matching</dc:subject>
  <dc:subject>Independent set</dc:subject>
  <dc:subject>König property</dc:subject>
  <dc:subject>Graph reduction</dc:subject>
  <dc:subject>Graph algorithm</dc:subject>
  <dc:title>On the König deficiency of zero-reducible graphs</dc:title>
Views 78
Downloads 93
Data volume 57.8 MB
Unique views 74
Unique downloads 91


Cite as