Biregular subgraphs of biregular graphs (Q1091405): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3941433 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Subgraphs with prescribed valencies / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Subgraph Problem / rank | |||
Normal rank |
Revision as of 10:41, 18 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Biregular subgraphs of biregular graphs |
scientific article |
Statements
Biregular subgraphs of biregular graphs (English)
0 references
1987
0 references
The following theorem is proved: Every biregular graph whose degrees are either k or \(k+1\) contains a spanning biregular subgraph whose degrees are either r or \(r+1\) where \(0\leq r\leq k\). This result is the best possible in the sense that a family of biregular graphs whose degrees are either \(\delta\) or \(\delta +k\) (\(\delta\geq 2\), \(k\geq 2)\) has been found with the property that they do not contain a spanning biregular subgraph whose degrees are either \(\delta\)-1 or \(\delta\).
0 references
biregular graph
0 references
spanning biregular subgraph
0 references