scientific article; zbMATH DE number 3480616
From MaRDI portal
Publication:4063170
Cited in
(13)- Graph structural properties of non-Yutsis graphs allowing fast recognition
- The integrity of a cubic graph
- On the maximum induced forests of a connected cubic graph without triangles
- Sparse graphs with bounded induced cycle packing number have logarithmic treewidth
- Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs
- Some remarks on Jaeger's dual-hamiltonian conjecture
- The k-conversion number of regular graphs
- A lower bound on the \(k\)-conversion number of graphs of maximum degree \(k+1\)
- Induced forests in cubic graphs
- To be or not to be Yutsis: algorithms for the decision problem
- Subgraph-avoiding minimum decycling sets and \(k\)-conversion sets in graphs
- A feedback vertex set of 2-degenerate graphs
- To be or not to be Yutsis
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4063170)
