Vertex-disjoint hexagons with chords in a bipartite graph

DOI10.1016/S0012-365X(97)00236-7zbMath0958.05116MaRDI QIDQ1584300

Hong Wang

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

chordsbipartite graphvertex-disjoint subgraphsvertex-disjoint hexagons

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (6)

The edge condition for independent cycles with chords in bipartite graphs ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Tiling tripartite graphs with 3-colorable graphs: the extreme case ⋮ Ore-type conditions for bipartite graphs containing hexagons ⋮ Vertex-disjoint double chorded cycles in bipartite graphs ⋮ Results and problems on chorded cycles: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• On vertex-disjoint complete bipartite subgraphs in a bipartite graph
• On the maximum number of independent cycles in a bipartite graph
• On the maximal number of independent circuits in a graph

This page was built for publication: Vertex-disjoint hexagons with chords in a bipartite graph