On a conjecture of Keedwell and the cycle double cover conjecture
DOI10.1016/S0012-365X(99)00356-8zbMATH Open0973.05028OpenAlexW2097887535WikidataQ123020487 ScholiaQ123020487MaRDI QIDQ1567293FDOQ1567293
Authors: R. Tusserkani, Mohammad Mahdian, E. S. Mahmoodian, Amin Saberi, Mohammad Salavatipour 
Publication date: 28 November 2001
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00356-8
Recommendations
- On the simultaneous edge-coloring conjecture
- Nowhere-zero 4-flows; simultaneous edge-colorings; and critical partial Latin squares
- On the simultaneous edge coloring of graphs
- Determination of regular embeddings of graphs on surfaces
- scientific article; zbMATH DE number 1294016
- Ramsey Problems with Bounded Degree Spread
- Circle graphs and the cycle double cover conjecture
- Constructing a bipartite graph of maximum connectivity with prescribed degrees
- Bipartite-assembly
- A sufficient condition for a pair of sequences to be bipartite graphic
Vertex degrees (05C07) Eulerian and Hamiltonian graphs (05C45) Orthogonal arrays, Latin squares, Room squares (05B15) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (7)
- Hadwiger's covering conjecture and low dimensional dual cyclic polytopes
- Constructing and deconstructing Latin trades
- On the simultaneous edge-coloring conjecture
- Short cycle covers and the cycle double cover conjecture
- Nowhere-zero 4-flows; simultaneous edge-colorings; and critical partial Latin squares
- On DRC‐covering of Kn by cycles
- On the simultaneous edge coloring of graphs
This page was built for publication: On a conjecture of Keedwell and the cycle double cover conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1567293)
