Covering Multigraphs by Simple Circuits (Q3703929): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Covering Graphs by Simple Circuits / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Flows and generalized coloring theorems in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the eulericity of a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Nowhere-zero 6-flows / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Contribution to the Theory of Chromatic Polynomials / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Shortest coverings of graphs with cycles / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Integer flows / rank | |||
Normal rank |
Latest revision as of 18:47, 14 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Covering Multigraphs by Simple Circuits |
scientific article |
Statements
Covering Multigraphs by Simple Circuits (English)
0 references
1985
0 references
Eulerian subgraphs
0 references
graph algorithms
0 references
nowhere-zero flow
0 references
minimum cover
0 references
bridgeless multigraph
0 references