Multigraphic degree sequences and supereulerian graphs, disjoint spanning trees (Q452949): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q5422499 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Line removal algorithms for graphs and their degree lists / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Degree sequence and supereulerian graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Degree sequences and graphs with disjoint spanning trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Eulerian and Hamiltonian Graphs and Line Graphs / rank | |||
Normal rank | |||
Revision as of 16:22, 5 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Multigraphic degree sequences and supereulerian graphs, disjoint spanning trees |
scientific article |
Statements
Multigraphic degree sequences and supereulerian graphs, disjoint spanning trees (English)
0 references
18 September 2012
0 references
multigraphic degree sequence
0 references
Hamiltonian line graphs
0 references
supereulerian graphs
0 references
edge-disjoint spanning trees
0 references
