Connected even factors in claw-free graphs
A graph \(G\) is \(K_{1,k}\)-free if no induced subgraph of \(G\) is isomorphic to \(K_{1,k}\), and is supereulerian if it contains a spanning closed trail. A connected even \([2,2s]\)-factor of \(G\) is a connected factor with all vertices of degree \(i\;(i=2,4,\dots,2s)\) where \(s\geq1\) is an integer. It is proved that every supereulerian \(K_{1,k}\)-free graph (\(k\geq2\)) contains a connected even \([2,2k-2]\)-factor. This result generalizes analogous result by \textit{H. J. Broersma, M. Kriesell} and \textit{Z. Ryjacek} [``On factors of 4-connected claw-free graphs, J. Graph Theory 37, No.~2, 125--136 (2001; Zbl 0984.05067)] for \(k=3\).
- scientific article; zbMATH DE number 6475977
- Forbidden pairs for connected even factors in supereulerian graphs
- Supereulerian graphs with small circumference and 3-connected Hamiltonian claw-free graphs
- Forbidden set of induced subgraphs for 2-connected supereulerian graphs
- Connected factors in 2-connected claw-free graphs
- Characterization of forbidden subgraphs for the existence of even factors in a graph
- Connected even factors in \(k\)-tree
- Tank-ring factors in supereulerian claw-free graphs
- Connected even factors in the square of essentially 2-edge-connected graph
- Factors of claw-free graphs
- scientific article; zbMATH DE number 2188396 (Why is no real title available?)
- scientific article; zbMATH DE number 6475977 (Why is no real title available?)
- Forbidden pairs for connected even factors in supereulerian graphs
- Induced claws and existence of even factors of graphs
This page was built for publication: Connected even factors in claw-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2483413)
