Odd factors of a graph (Q1313354): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Preben Dahl Vestergaard / rank | |||
Property / reviewed by | |||
Property / reviewed by: Katherine Heinrich / rank | |||
Property / author | |||
Property / author: Preben Dahl Vestergaard / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Katherine Heinrich / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Factors and factorizations of graphs—a survey / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On factors with all degrees odd / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the 1-factors of a non-separable graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5677528 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4168941 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A graph polynomial and its applications / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note concerning graphs with unique f-factors / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3267903 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4074931 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graphs with 1-Factors / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: 1-Factors and Antifactor Sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Factorization of Linear Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graph factors / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some results on odd factors of graphs / rank | |||
Normal rank |
Latest revision as of 12:37, 22 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Odd factors of a graph |
scientific article |
Statements
Odd factors of a graph (English)
0 references
11 September 1994
0 references
\textit{C. Yuting} and \textit{M. Kano} [J. Graph Theory 12, No. 3, 327-333 (1988; Zbl 0661.05049)] gave a necessary and sufficient condition for \(G\) to have a \([1,f]\)-odd factor (where given \(f:v(G) \to \{1,3,5, \dots\}\), a \([1,f]\)-odd factor is a subgraph \(H\) of \(G\) so that \(\deg_ H (x) \in \{1,2, \dots, f(x)\}\) for all \(x \in V(G))\). As is typical for this type of result an inequality must be checked for each subset of \(V(G)\). In the case when \(G\) is a tree they show that only \(| V(G) |\) inequalities need to be checked. The authors of the paper under review are interested in discovering for which graphs fewer inequalities can be considered. They do this by studying barrier sets. In particular, they show: (1) If \(G\) has even order and is \(n\)-connected it has a \([1,f]\)-odd factor if no vertex of \(G\) is the centre of an induced star \(K_{1,nf(v)+1}\); (2) If \(G\) is a connected block graph of even order only \(| V(G) |\) inequalities need be checked; and (3) If \(G\) is a unicyclic graph of even order at most \({| V (G) | \choose 2}\) inequalities need be checked. Results for cacti are also obtained.
0 references
factor
0 references
tree
0 references
barrier sets
0 references
block graph
0 references
unicyclic graph
0 references
cacti
0 references