scientific article; zbMATH DE number 1294016

MaRDI QIDQ4246280zbMATH OpenFDO

Authors Pedro Mago, Gladys Lárez, Felicia Villarroel

Publication date 28 October 1999

zbMATH Keywords

degree sequencegraphical bipartite sequenceHamiltonian graph

Mathematics Subject Classification ID

Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45) Graph theory (05C99)

Recommendations

• A sufficient condition for a pair of sequences to be bipartite graphic
• Constructing a bipartite graph of maximum connectivity with prescribed degrees
• Degree symmetric bipartite graphs and equivalent representations
• An extension of a result of Alon, Ben-Shimon and Krivelevich on bipartite graph vertex sequences
• scientific article; zbMATH DE number 140141

Cited in

(10)

• On the simultaneous edge-coloring conjecture
• On a conjecture of Keedwell and the cycle double cover conjecture
• Planar bipartite biregular degree sequences
• A sharp refinement of a result of Alon, Ben-Shimon and Krivelevich on bipartite graph vertex sequences
• Sufficient conditions for graphicality of bidegree sequences
• A sufficient condition for a pair of sequences to be bipartite graphic
• Degree symmetric bipartite graphs and equivalent representations
• scientific article; zbMATH DE number 4053680 (Why is no real title available?)
• Constructing a bipartite graph of maximum connectivity with prescribed degrees
• An efficient algorithm to test potential bipartiteness of graphical degree sequences

This page was built for publication:

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