The following pages link to <i>k</i>-Degenerate Graphs (Q5599569):
Displaying 50 items.
- Lower bounds for the independence and \(k\)-independence number of graphs using the concept of degenerate degrees (Q260061) (← links)
- A feedback vertex set of 2-degenerate graphs (Q300250) (← links)
- A bound on the values of independence polynomials at \(-1/k\) for \(k\)-degenerate graphs (Q385733) (← links)
- Locally identifying colourings for graphs with given maximum degree (Q418899) (← links)
- Note on coloring of double disk graphs (Q475816) (← links)
- Solving maximum clique in sparse graphs: an \({O(nm+n2^{d/4})}\) algorithm for \(d\)-degenerate graphs (Q479213) (← links)
- Maximum 4-degenerate subgraph of a planar graph (Q490312) (← links)
- Parameterized leaf power recognition via embedding into graph products (Q786044) (← links)
- Graph factorization and theorems of the Nordhaus-Gaddum class (Q802576) (← links)
- Upper bound for linear arboricity (Q809087) (← links)
- Dense trees: a new look at degenerate graphs (Q849635) (← links)
- Independence polynomials of \(k\)-tree related graphs (Q972329) (← links)
- The parameterized complexity of editing graphs for bounded degeneracy (Q986553) (← links)
- On a cycle partition problem (Q998373) (← links)
- Coloring geometric range spaces (Q1017922) (← links)
- Erdős-Hajnal well-orderings and n-degenerate graphs (Q1143403) (← links)
- On graphs critical with respect to vertex partition numbers (Q1157342) (← links)
- Critically partitionable graphs. II (Q1168331) (← links)
- A search problem on graphs which generalizes some group testing problems with two defectives (Q1176719) (← links)
- Note to the paper of Grünbaum on acyclic colorings (Q1222168) (← links)
- Joins of n-degenerate graphs and uniquely (m,n)-partitionable graphs (Q1229733) (← links)
- An extension of Brooks' theorem to n-degenerate graphs (Q1235185) (← links)
- Some results in topological graph theory (Q1241523) (← links)
- k-Blocks and Ultrablocks in Graphs (Q1247438) (← links)
- Chromatic partitions of a graph (Q1263595) (← links)
- The game coloring number of planar graphs (Q1305532) (← links)
- Treewidth for graphs with small chordality (Q1372729) (← links)
- Efficiently enumerating all maximal cliques with bit-parallelism (Q1651581) (← links)
- Some bounds on the generalised total chromatic number of degenerate graphs (Q1675922) (← links)
- A new decomposition technique for maximal clique enumeration for sparse graphs (Q1740688) (← links)
- Reconfiguration on sparse graphs (Q1747496) (← links)
- The subchromatic number of a graph (Q1823255) (← links)
- Large survivable nets and the generalized prisms (Q1897364) (← links)
- Efficient enumeration of maximal induced bicliques (Q1983137) (← links)
- Efficient enumeration of dominating sets for sparse graphs (Q1983139) (← links)
- In search of the densest subgraph (Q2005555) (← links)
- Partitioning a graph into degenerate subgraphs (Q2011133) (← links)
- A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number (Q2034408) (← links)
- On chordal phylogeny graphs (Q2043361) (← links)
- Computing the depth distribution of a set of boxes (Q2049979) (← links)
- On zero-sum spanning trees and zero-sum connectivity (Q2073300) (← links)
- Worst-case analysis of clique MIPs (Q2089781) (← links)
- Locally defined independence systems on graphs (Q2109105) (← links)
- Point partition numbers: perfect graphs (Q2115144) (← links)
- On primes and practical numbers (Q2115268) (← links)
- The space complexity of sum labelling (Q2140502) (← links)
- Point partition numbers: decomposable and indecomposable critical graphs (Q2142640) (← links)
- Weighted 2-sections and hypergraph reconstruction (Q2143117) (← links)
- A polynomial-time approximation to a minimum dominating set in a graph (Q2166772) (← links)
- Cusp universality for random matrices. I: Local law and the complex Hermitian case (Q2192723) (← links)
