Structure theorem and algorithm on \((1,f)\)-odd subgraph (Q878634): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.disc.2005.11.078 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2012615766 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4371290 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: General factors of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some results on odd factors of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Odd subgraphs and matchings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The factorization of graphs. II / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Matching theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Odd factors of a graph / rank | |||
Normal rank |
Latest revision as of 18:14, 25 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Structure theorem and algorithm on \((1,f)\)-odd subgraph |
scientific article |
Statements
Structure theorem and algorithm on \((1,f)\)-odd subgraph (English)
0 references
26 April 2007
0 references
\((1
0 references
f)\)-odd subgraphs
0 references
Gallai-Edmonds type structure theorem
0 references
generalized matching algorithm
0 references