On factorable degree sequences

DOI10.1016/0095-8956(72)90055-XzbMath0224.05126OpenAlexW2012447199WikidataQ105916614 ScholiaQ105916614MaRDI QIDQ2548259

A. Ramachandra Rao, Siddani Bhaskara Rao

Publication date: 1972

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(72)90055-x

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items (17)

Packing of graphic n-tuples ⋮ The structure matrix of the class of \(r\)-multigraphs with a prescribed degree sequence ⋮ A short proof of Kundu's k-factor theorem ⋮ On factorable bigraphic pairs ⋮ Forcibly bipartite and acyclic (uni-)graphic sequences ⋮ Realizing disjoint degree sequences of span at most two: a tractable discrete tomography problem ⋮ The k-factor conjecture is true ⋮ Alternating Eulerian trails with prescribed degrees in two edge-colored complete graphs ⋮ Graphs and degree sequences. I ⋮ Navigating between packings of graphic sequences ⋮ Characterization of self-complementary graphs with 2-factors ⋮ Construction of Hamiltonian graphs and bigraphs with prescribed degrees ⋮ Solution of the Hamiltonian problem for self-complementary graphs ⋮ Minimal Hamiltonian graphs with prescribed degree sets ⋮ On a problem of potentially pancyclic-graphic sequences due to S.B. Rao ⋮ Graphs and degree sequences: Canonical decomposition ⋮ Generalizations of the k-factor theorem

Cites Work

• Local Restrictions for Various Classes of Directed Graphs
• Unnamed Item

This page was built for publication: On factorable degree sequences