2 papers
math.CO2007
On path factors of (3,4)-biregular bigraphs
Armen S. Asratian, Carl Johan Casselgren
A (3,4)-biregular bigraph G is a bipartite graph where all vertices in one part have degree 3 and all vertices in the other part have degree 4. A path factor of G is a spanning sub…
math.CO2007
Proper path-factors and interval edge-coloring of (3,4)-biregular bigraphs
Armen S. Asratian, Carl Johan Casselgren, Jennifer Vandenbussche +1
An interval coloring of a graph G is a proper coloring of E(G) by positive integers such that the colors on the edges incident to any vertex are consecutive. A (3,4)-biregular bigr…