Perfect matchings in -regular graphs.

Alon, Noga; Rödl, Vojtěch; Ruciński, Andrzej

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

The search session has expired. Please query the service again.

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

Maximum matchings in regular graphs of high girth.

Flaxman, Abraham D., Hoory, Shlomo (2007)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Regular spanning subgraphs of bipartite graphs of high minimum degree.

Csaba, Béla (2007)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

The sum of degrees in cliques.

Bollobás, Béla, Nikiforov, Vladimir (2005)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Note on linear arboricity of graphs with large girth

Filip Guldan (1991)

Czechoslovak Mathematical Journal

Similarity:

Large holes in quasi-random graphs.

Polcyn, Joanna (2008)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Polynomial time algorithms for two classes of subgraph problem

Sriraman Sridharan (2008)

RAIRO - Operations Research

Similarity:

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.”