Decomposition of Complete Bipartite Even Graphs into Closed Trails (Q4802830): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Packing Circuits into <i>K</i><sub><i>N</i></sub> / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Vertex distinguishing colorings of graphs with \(\Delta(G)=2\) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Balanced edge colorings. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the vertex-distinguishing proper edge-colorings of graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4886768 / rank | |||
Normal rank | |||
Revision as of 14:17, 5 June 2024
scientific article; zbMATH DE number 1899914
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decomposition of Complete Bipartite Even Graphs into Closed Trails |
scientific article; zbMATH DE number 1899914 |
Statements
Decomposition of Complete Bipartite Even Graphs into Closed Trails (English)
0 references
23 April 2003
0 references
complete bipartite graph
0 references
closed trail
0 references
arbitrarily decomposable graph
0 references
