In a search for triangle-free graphs with arbitrarily large chromatic number,Mycielski developed a graph transformation that transforms a graph G into a new graph(G),which is called the Mycielskian of G.A generalisati...In a search for triangle-free graphs with arbitrarily large chromatic number,Mycielski developed a graph transformation that transforms a graph G into a new graph(G),which is called the Mycielskian of G.A generalisation of this transformation is the generalised Mycielskian,denoted bym(G),where m is a positive integer.This paper investigates the hamiltonicity and some matching-related properties of generalized Mycielskianm(G).展开更多
文摘In a search for triangle-free graphs with arbitrarily large chromatic number,Mycielski developed a graph transformation that transforms a graph G into a new graph(G),which is called the Mycielskian of G.A generalisation of this transformation is the generalised Mycielskian,denoted bym(G),where m is a positive integer.This paper investigates the hamiltonicity and some matching-related properties of generalized Mycielskianm(G).
