On bicriticality of (3,6)-fullerene graphs
Sign Up to like & getrecommendations! Published in 2018 at "Journal of Mathematical Chemistry"
DOI: 10.1007/s10910-018-0917-2
Abstract: A (3,6)-fullerene is a plane cubic graph whose faces are only triangles and hexagons. A connected graph G with at least $$2n+2$$2n+2 vertices is said to be n-extendable if it has n independent edges and… read more here.
Keywords: chemistry; fullerene; fullerene graphs; graph ... See more keywords