Line removal algorithms for graphs and their degree lists
From MaRDI portal
Publication:4124864
Cited in
(11)- Degree sequences and graphs with disjoint spanning trees
- Group Connectivity, Strongly Z_m-Connectivity, and Edge Disjoint Spanning Trees
- Analyse und Synthese zuverlässiger Netze
- Graphs and degree sequences. I
- Multigraphic degree sequences and Hamiltonian-connected line graphs
- A remark on degree sequences of multigraphs
- Graphs and degree sequences: Canonical decomposition
- Realizability of p-point graphs with prescribed minimum degree, maximum degree, and point-connectivity
- Rejection sampling of bipartite graphs with given degree sequence
- Modulo 5-orientations and degree sequences
- Multigraphic degree sequences and supereulerian graphs, disjoint spanning trees
This page was built for publication: Line removal algorithms for graphs and their degree lists
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4124864)