On factorable degree sequences

DOI10.1016/0095-8956(72)90055-XMaRDI QIDQ2548259zbMATH OpenOpenAlexWikidataFDO

Authors A. Ramachandra Rao, S. B. 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)

Cites work

• scientific article; zbMATH DE number 3159208 (Why is no real title available?)
• Local Restrictions for Various Classes of Directed Graphs

Cited in

(19)

• A short proof of Kundu's k-factor theorem
• Alternating Eulerian trails with prescribed degrees in two edge-colored complete graphs
• 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
• The k-factor conjecture is true
• Generalizations of the k-factor theorem
• Navigating between packings of graphic sequences
• On factorable bigraphic pairs
• On a problem of potentially pancyclic-graphic sequences due to S.B. Rao
• The structure matrix of the class of r-multigraphs with a prescribed degree sequence
• Packing of graphic n-tuples
• Graphs and degree sequences: Canonical decomposition
• Graphs and degree sequences. I
• Forcibly bipartite and acyclic (uni-)graphic sequences
• Realizing disjoint degree sequences of span at most two: a tractable discrete tomography problem
• Degree realization with minimum dominating set
• Degree realization with maximum matching
• Minimal Hamiltonian graphs with prescribed degree sets

This page was built for publication: On factorable degree sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2548259)