The k-factor conjecture is true

DOI10.1016/0012-365X(73)90068-XMaRDI QIDQ1394360zbMATH OpenWikidataFDO

Authors Sukhamay Kundu

Publication date 1973

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(73)90068-X

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph theory (05C99)

Cites work

• Algorithms for constructing graphs and digraphs with given valences and factors
• Disjoint Representation of Tree Realizable Sequences
• On factorable degree sequences
• Zero-one matrices with zero trace

Cited in

(33)

• A short proof of Kundu's k-factor theorem
• On joint realization of (0,1) matrices
• Matrices with prescribed row, column and block sums
• On Ryser's maximum term rank formula
• 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
• Some special realizations of partition matrix sequences
• Generalizations of the k-factor theorem
• Degree sequences and the existence of k-factors
• Navigating between packings of graphic sequences
• Maximum size of a graph with given fractional matching number
• On factorable bigraphic pairs
• Packing tree degree sequences
• On the potential function of an arbitrary graph \(H\)
• 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
• Algorithms for constructing graphs and digraphs with given valences and factors
• Packing of graphic n-tuples
• Dag realizations of directed degree sequences
• Extremal theorems for degree sequence packing and the two-color discrete tomography problem
• Graphs and degree sequences. I
• The class of 2-multigraphs with a prescribed degree sequence
• Graphic Sequences Have Realizations Containing Bisections of Large Degree
• On the swap-distances of different realizations of a graphical degree sequence
• Multi-switch: a tool for finding potential edge-disjoint 1-factors
• A note on packing of graphic \(n\)-tuples
• Eigenvalues and [a,b]‐factors in regular graphs
• Realizing disjoint degree sequences of span at most two: a tractable discrete tomography problem
• A characterization for a graphic sequence to be potentially \(C_{r}\)-graphic
• Random partitions and edge-disjoint Hamiltonian cycles
• Minimal Hamiltonian graphs with prescribed degree sets
• Graph factors and factorization: 1985--2003: a survey

This page was built for publication: The k-factor conjecture is true

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