2009•European Journal of CombinatoricsOpen access

Matching graphs of hypercubes and complete bipartite graphs

Jiří Fink

Open full text 21 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

Open-access reader

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 21 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Combinatorics, Hypercube, Mathematics, Bipartite graph, Hamiltonian path, Conjecture, Perfect graph theorem, Strong perfect graph theorem

Back to paper search Browse research topics Original source

Matching graphs of hypercubes and complete bipartite graphs — Research Paper | ScholarLens