Preskoči na glavno vsebino

Tomaž Pisanski: One factor graphs

Datum objave: 20. 11. 2011
Seminar za diskretno matematiko
Torek, 22. 11. 2011 od 10h do 12h, Plemljev seminar, Jadranska 19

Povzetek. The one-factor graph F(G) of a graph G is a graph with vertices consisting of one-factors in G and two vertices being adjacent if and only if the corresponding one-factors are edge-disjoint. Some properties of one-factor graphs are explored. The emphasis is on the one-factor graphs of trivalent graphs. Some other graphs, such as resonance graphs, defined on the set of one-factors of G, are mentioned.

This is work in progress with Milan Randic.