Combinatorial Geometry and Graph Theory

DOI10.1007/b105263zbMath1117.05022OpenAlexW2480216131MaRDI QIDQ5491728

Narong Punnim

Publication date: 10 October 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b105263

zbMATH Keywords

cubic graphdegree sequencedecycling number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07)

Related Items (6)

Unnamed Item ⋮ New formulae for the decycling number of graphs ⋮ A new formula for the decycling number of regular graphs ⋮ A lower bound on the $k$-conversion number of graphs of maximum degree $k+1$ ⋮ The k-conversion number of regular graphs ⋮ Cycle intersection graphs and minimum decycling sets of even graphs

This page was built for publication: Combinatorial Geometry and Graph Theory