A degree sum condition for the existence of an \(S\)-path-system in a bipartite graph (Q2319727): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Proof of a conjecture of Haeggkvist on cycles and independent edges / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3577833 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Characterizing degree-sum maximal nonhamiltonian bipartite graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Generalization of a Theorem of Posa / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Degree sum conditions for path-factors with specified end vertices in bipartite graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Hamiltonian bipartite graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: 2‐neighborhoods and hamiltonian conditions / rank | |||
Normal rank | |||
Latest revision as of 05:17, 20 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A degree sum condition for the existence of an \(S\)-path-system in a bipartite graph |
scientific article |
Statements
A degree sum condition for the existence of an \(S\)-path-system in a bipartite graph (English)
0 references
20 August 2019
0 references
paths
0 references
path-factor
0 references
degree sum condition
0 references
bipartite graph
0 references
