Line removal algorithms for graphs and their degree lists

DOI10.1109/TCS.1976.1084170zbMath0354.05044OpenAlexW2072134898MaRDI QIDQ4124864

F. T. Boesch, Frank Harary

Publication date: 1976

Published in: IEEE Transactions on Circuits and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tcs.1976.1084170

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items (11)

Group Connectivity, Strongly Z_m-Connectivity, and Edge Disjoint Spanning Trees ⋮ Realizability of p-point graphs with prescribed minimum degree, maximum degree, and point-connectivity ⋮ Degree sequences and graphs with disjoint spanning trees ⋮ Multigraphic degree sequences and supereulerian graphs, disjoint spanning trees ⋮ Graphs and degree sequences. I ⋮ Rejection sampling of bipartite graphs with given degree sequence ⋮ Modulo 5-orientations and degree sequences ⋮ Multigraphic degree sequences and Hamiltonian-connected line graphs ⋮ A remark on degree sequences of multigraphs ⋮ Analyse und Synthese zuverlässiger Netze ⋮ Graphs and degree sequences: Canonical decomposition

This page was built for publication: Line removal algorithms for graphs and their degree lists