Perfect matchings in -regular graphs.

We design a polynomial time algorithm for finding a -1)- regular subgraph in a -regular graph without any induced star (claw-free). A polynomial time algorithm for finding a cubic subgraph in a 4-regular locally connected graph is also given. A family of -regular graphs with an induced star (, not containing any (-1)-regular subgraph is also constructed.

Scheduling partial round Robin tournaments subject to home away pattern sets.

Kashiwabara, Kenji (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

The linear arboricity of $10$ -regular graphs

Filip Guldan (1986)

Mathematica Slovaca

Similarity:

Displaying similar documents to “Perfect matchings in ε -regular graphs.”

Displaying similar documents to “Perfect matchings in $ε$ -regular graphs.”