Pan-factorial property in regular graphs

MaRDI QIDQ2583675zbMATH OpenFDO

Authors Qinglin Roger Yu, Mikio Kano

Publication date 17 January 2006

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/125465, http://www.emis.de/journals/EJC/Volume_12/Abstracts/v12i1n23.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Review text

Summary: Among other results, we show that if for any given edge \(e\) of an \(r\)-regular graph \(G\) of even order, \(G\) has a 1-factor containing \(e\), then \(G\) has a \(k\)-factor containing \(e\) and another one avoiding \(e\) for all \(k\), \(1\leq k\leq r-1\).

Recommendations

• Regular factors in regular graphs
• \(k\) -factors in regular graphs
• Even regular factor of regular graphs and number of cut edges
• scientific article; zbMATH DE number 3904628
• A short proof of a theorem of Kano and Yu on factors in regular graphs

Cited in

(5)

• A short proof of a theorem of Kano and Yu on factors in regular graphs
• scientific article; zbMATH DE number 1843996 (Why is no real title available?)
• Matching extension and matching exclusion via the size or the spectral radius of graphs
• Even regular factor of regular graphs and number of cut edges
• \(k\)-factors in regular graphs and edge-connectivity

This page was built for publication: Pan-factorial property in regular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583675)