On bicriticality of (3, 6)-fullerene graphs
C Sun, H Zhang - Journal of Mathematical Chemistry, 2018 - Springer
Abstract A (3, 6)-fullerene is a plane cubic graph whose faces are only triangles and
hexagons. A connected graph G with at least 2 n+ 2 2 n+ 2 vertices is said to be n …
hexagons. A connected graph G with at least 2 n+ 2 2 n+ 2 vertices is said to be n …
On the computational complexity of the bipartizing matching problem
Given a graph G=(V, E) G=(V, E), an edge bipartization set of G is a subset E'⊆ E (G) E′⊆
E (G) such that G'=(V, E ∖ E') G′=(V, E\E′) is bipartite. An edge bipartization set that is …
E (G) such that G'=(V, E ∖ E') G′=(V, E\E′) is bipartite. An edge bipartization set that is …
[PDF][PDF] Eliminating Odd Cycles by Removing a Matching
We study the problem of determining whether a given graph G=(V, E) admits a matching M
whose removal destroys all odd cycles of G (or equivalently whether G− M is bipartite). This …
whose removal destroys all odd cycles of G (or equivalently whether G− M is bipartite). This …
Complexity and algorithms related to two classes of graph problems
CVGC Lima - 2017 - pantheon.ufrj.br
This thesis addresses the problems associated with conversions on graphs and editing by
removing a matching. We study the f-reversible processes, which are those associated with …
removing a matching. We study the f-reversible processes, which are those associated with …