AbstractThe coupled graph c(G) of a plane graph G is the graph defined on the vertex set V(G)∪F(G) so that two vertices in c(G) are joined by an edge if and only if they are adjacent or incident in G. We prove that the coupled graph of a 2-connected plane graph is edge-pancyclic. However, there exists a 2-edge-connected plane graph G such that c(G) is not Hamiltonian
AbstractBill Jackson has proved that every 2-connected, k-regular graph on at most 3k vertices is ha...
AbstractIn this paper we show that the entire graph of a bridgeless connected plane graph is hamilto...
AbstractA graph G is pancyclic if it contains a k-cycle for k = 3,4,…,|V(G)|. In this paper we show ...
AbstractThe coupled graph c(G) of a plane graph G is the graph defined on the vertex set V(G)∪F(G) s...
The coupled graph c(G) of a plane graph G is the graph de.ned on the vertex set V (G)∪F(G) so that t...
AbstractThe edge-face-total graph r(G) of a plane graph G is the graph defined on the vertex set E(G...
AbstractThe square of a graph G is the graph obtained from G by adding edges joining those pairs of ...
AbstractA graph G with vertex set V(G) and edge set E(G) is pancyclic if it contains cycles of all l...
AbstractFor a graph G, let σ2(G) denote the minimum degree sum of two nonadjacent vertices (when G i...
Hamiltonian graph theory has been widely studied as one of the most important problems in graph theo...
AbstractWe characterize graphs G such that the complements of their line graphs are pancyclic
AbstractA celebrated theorem of Chvátal and Erdős says that G is Hamiltonian if κ(G)⩾α(G), where κ(G...
AbstractThe square G2 of a graph G is the graph having the same vertex set as G and two vertices are...
We first show that if a 2-connected graph G of order n is such that for each two vertices u and v su...
AbstractUsing the property that being s-edge-Hamiltonian is (n+s)-stable, we characterize all 3-conn...
AbstractBill Jackson has proved that every 2-connected, k-regular graph on at most 3k vertices is ha...
AbstractIn this paper we show that the entire graph of a bridgeless connected plane graph is hamilto...
AbstractA graph G is pancyclic if it contains a k-cycle for k = 3,4,…,|V(G)|. In this paper we show ...
AbstractThe coupled graph c(G) of a plane graph G is the graph defined on the vertex set V(G)∪F(G) s...
The coupled graph c(G) of a plane graph G is the graph de.ned on the vertex set V (G)∪F(G) so that t...
AbstractThe edge-face-total graph r(G) of a plane graph G is the graph defined on the vertex set E(G...
AbstractThe square of a graph G is the graph obtained from G by adding edges joining those pairs of ...
AbstractA graph G with vertex set V(G) and edge set E(G) is pancyclic if it contains cycles of all l...
AbstractFor a graph G, let σ2(G) denote the minimum degree sum of two nonadjacent vertices (when G i...
Hamiltonian graph theory has been widely studied as one of the most important problems in graph theo...
AbstractWe characterize graphs G such that the complements of their line graphs are pancyclic
AbstractA celebrated theorem of Chvátal and Erdős says that G is Hamiltonian if κ(G)⩾α(G), where κ(G...
AbstractThe square G2 of a graph G is the graph having the same vertex set as G and two vertices are...
We first show that if a 2-connected graph G of order n is such that for each two vertices u and v su...
AbstractUsing the property that being s-edge-Hamiltonian is (n+s)-stable, we characterize all 3-conn...
AbstractBill Jackson has proved that every 2-connected, k-regular graph on at most 3k vertices is ha...
AbstractIn this paper we show that the entire graph of a bridgeless connected plane graph is hamilto...
AbstractA graph G is pancyclic if it contains a k-cycle for k = 3,4,…,|V(G)|. In this paper we show ...
View in ORKG
DOI