Rainbow C₄'s and directed C₄'s: the bipartite case study
From MaRDI portal
Publication:262974
DOI10.1007/S40840-015-0125-1zbMATH Open1332.05079arXiv1301.5697OpenAlexW2952193476MaRDI QIDQ262974FDOQ262974
Publication date: 4 April 2016
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Abstract: In this paper we obtain a new sufficient condition for the existence of directed cycles of length 4 in oriented bipartite graphs. As a corollary, a conjecture of H. Li is confirmed. As an application, a sufficient condition for the existence of rainbow cycles of length 4 in bipartite edge-colored graphs is obtained.
Full work available at URL: https://arxiv.org/abs/1301.5697
Recommendations
- Rainbow copies of \(C_4\) in edge-colored hypercubes
- Rainbow \(C_3\)'s and \(C_4\)'s in edge-colored graphs
- Rainbow matchings in Dirac bipartite graphs
- On the spectra of bipartite directed subgraphs of \(K^\ast_4\)
- Rainbow tetrahedra in Cayley graphs
- \(C_4\)-saturated bipartite graphs
- On a \(\vec C_4\)-ultrahomogeneous oriented graph
- scientific article; zbMATH DE number 2115931
- \(P_4\)-colorings and \(P_4\)-bipartite graphs
- Proper edge colorings of Cartesian products with rainbow \(C_4\)-s
Directed graphs (digraphs), tournaments (05C20) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)
Cites Work
- Graph theory
- Color neighborhood union conditions for long heterochromatic paths in edge-colored graphs
- Heterochromatic matchings in edge-colored graphs
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
- Path and cycle sub-Ramsey numbers and an edge-colouring conjecture
- Multicoloured Hamilton cycles
- A note on heterochromatic \(C_4\) in edge-colored triangle-free graphs
- On the strong rainbow connection of a graph
- Rainbow triangles in edge-colored graphs
- Long heterochromatic paths in edge-colored graphs
- Large rainbow matchings in edge-coloured graphs
- Title not available (Why is that?)
- Rainbow \(C_3\)'s and \(C_4\)'s in edge-colored graphs
- Color degree and heterochromatic cycles in edge-colored graphs
- Title not available (Why is that?)
- Polychromatic Hamilton cycles
- Rainbow matching in edge-colored graphs
Cited In (2)
This page was built for publication: Rainbow \(C_4\)'s and directed \(C_4\)'s: the bipartite case study
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q262974)