Line removal algorithms for graphs and their degree lists

DOI10.1109/TCS.1976.1084170zbMATH Open0354.05044OpenAlexW2072134898MaRDI QIDQ4124864FDOQ4124864

Authors: 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)

Cited In (11)

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

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)