Hamiltonian circuits in chordal bipartite graphs
نویسندگان
چکیده
منابع مشابه
Alternating Hamiltonian circuits in edge-coloured bipartite graphs
Hilton, A. J. W., Alternating Hamiltonian circuits in edge-coloured bipartite graphs, Discrete Applied Mathematics 35 (1992) 271-273. We show that if G = K,, is edge-coloured with t-12 colours so that the subgraph induced by the edges of each colour is regular of order 2n, then G has a Hamiltonian circuit in which adjacent edges have different colours. We also give a generalization of this resu...
متن کاملRecognizing Chordal-Bipartite Probe Graphs
A graph G is chordal-bipartite probe if its vertices can be partitioned into two sets P (probes) and N (non-probes) where N is a stable set and such thatG can be extended to a chordal-bipartite graph by adding edges between non-probes. A bipartite graph is called chordal-bipartite if it contains no chordless cycle of length strictly greater than 5. Such probe/non-probe completion problems have ...
متن کاملTreewidth of Chordal Bipartite Graphs
Chordal bipartite graph are exactly those bipartite graph in which every cycle of length at least six has a chord. The treewidth of a graph G is the smallest maximum cliquesize among all chordal supergraphs of G decreased by one. We present a polynomial time algorithm for the exact computation of the treewidth of all chordal bipartite graphs. keywords: Graph algorithms, Algorithms and Data Stru...
متن کاملConnected matchings in chordal bipartite graphs
A connected matching in a graph is a collection of edges that are pairwise disjoint but joined by another edge of the graph. Motivated by applications to Hadwiger’s conjecture, Plummer, Stiebitz, and Toft [13] introduced connected matchings and proved that, given a positive integer k, determining whether a graph has a connected matching of size at least k is NPcomplete. Cameron [4] proved that ...
متن کاملStrongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone
A graph class is sandwich monotone if, for every pair of its graphs G1 = (V,E1) and G2 = (V,E2) with E1 ⊂ E2, there is an ordering e1, . . . , ek of the edges in E2 \E1 such that G = (V,E1 ∪ {e1, . . . , ei}) belongs to the class for every i between 1 and k. In this paper we show that strongly chordal graphs and chordal bipartite graphs are sandwich monotone, answering an open question by Bakon...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1996
ISSN: 0012-365X
DOI: 10.1016/0012-365x(95)00057-4