@article{Deo1977GeneralizationsOL,
title={Generalizations of Line Graphs and Applications},
author={N. Deo and M. Krishnamoorthy and Ajit B. Pai},
journal={Inf. Process. Lett.},
year={1977},
volume={6},
pages={14-17}
}

Only loopless, undirected, finite graphs without multiple edges will be considered here. The more-orless standard graph terminology used here can be found in mos: text books on graph theory, e.g. [ 1 ,5]. We denote a graph G = (V, E) w’here V is the set of vertices, and E, the set of edges of G. An ever1 (oddjfactor fof G is a non-null spanning subgraph of G, such that the degree of every vertex in fis even (odd). A perfect matchbg in a graph G is a spanning subgraph in which the degree of… Expand