Highly edge‐connected regular graphs without large factorizable subgraphs (Q6056797): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3195289762 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Upper Bound for the Excessive Index of an <i>r</i>‐Graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Regular \(n\)-valent \(n\)-connected non-Hamiltonian non \(n\)-edge-colourable graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Indecomposabler-graphs and some other counterexamples / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Factorizing regular graphs / rank | |||
Normal rank | |||
Latest revision as of 02:28, 3 August 2024
scientific article; zbMATH DE number 7745256
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Highly edge‐connected regular graphs without large factorizable subgraphs |
scientific article; zbMATH DE number 7745256 |
Statements
Highly edge‐connected regular graphs without large factorizable subgraphs (English)
0 references
4 October 2023
0 references
factorizations
0 references
perfect matchings
0 references
regular graphs
0 references
\(r\)-graphs
0 references
