Graphs with no \(M\)-alternating path between two vertices (Q1827684): 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.2003.08.002 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1971034268 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: \(M\)-alternating paths in \(n\)-extendable bipartite graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Characterizing \(2k\)-critical graphs and \(n\)-extendable graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5422499 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Paths, Trees, and Flowers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4820527 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4551374 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On n-extendable graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4393233 / rank | |||
Normal rank | |||
Latest revision as of 18:24, 6 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graphs with no \(M\)-alternating path between two vertices |
scientific article |
Statements
Graphs with no \(M\)-alternating path between two vertices (English)
0 references
6 August 2004
0 references
\(M\)-alternating path
0 references
Perfect matching
0 references
\(n\)-Extendable graphs
0 references
