D-graphs II: Constructions of D-graphs for some families of graphs with even cycles

Authors

  • Farrell E.J.
  • Wahid S.A.

Abstract

The fundamental edge algorithm is extended to multigraphs. Comatching D-graphs are then found for cycles, complete graphs and complete bipartite graphs. They all turn out to be proper multi-D-graphs. However it is shown that not all graphs have a comatching proper multi-D-graph.

Published

1999-06-09

How to Cite

Farrell E.J., & Wahid S.A. (1999). D-graphs II: Constructions of D-graphs for some families of graphs with even cycles. Utilitas Mathematica, 56. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/127

Issue

Section

Articles

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.