k-Degenerate Graphs - MaRDI portal

Cited in

(only showing first 100 items - show all)

Coloring geometric range spaces
Erdős-Hajnal well-orderings and n-degenerate graphs
On graphs critical with respect to vertex partition numbers
Critically partitionable graphs. II
A search problem on graphs which generalizes some group testing problems with two defectives
Note to the paper of Grünbaum on acyclic colorings
Joins of n-degenerate graphs and uniquely (m,n)-partitionable graphs
An extension of Brooks' theorem to n-degenerate graphs
Some results in topological graph theory
k-Blocks and Ultrablocks in Graphs
Chromatic partitions of a graph
The game coloring number of planar graphs
Treewidth for graphs with small chordality
Efficiently enumerating all maximal cliques with bit-parallelism
Some bounds on the generalised total chromatic number of degenerate graphs
A new decomposition technique for maximal clique enumeration for sparse graphs
The subchromatic number of a graph
Large survivable nets and the generalized prisms
Efficient enumeration of maximal induced bicliques
Efficient enumeration of dominating sets for sparse graphs
In search of the densest subgraph
Partitioning a graph into degenerate subgraphs
A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number
On chordal phylogeny graphs
Computing the depth distribution of a set of boxes
On zero-sum spanning trees and zero-sum connectivity
Worst-case analysis of clique MIPs
Locally defined independence systems on graphs
Point partition numbers: perfect graphs
On primes and practical numbers
The space complexity of sum labelling
Point partition numbers: decomposable and indecomposable critical graphs
Weighted 2-sections and hypergraph reconstruction
A polynomial-time approximation to a minimum dominating set in a graph
Cusp universality for random matrices. I: Local law and the complex Hermitian case
Sparsity measure of a network graph: Gini index
Consecutive colouring of oriented graphs
Eigenstate thermalization hypothesis for Wigner matrices
Total rainbow connection numbers of some special graphs
The clique-perfectness and clique-coloring of outer-planar graphs
Edge-intersection graphs of grid paths: the bend-number
Sharp bounds of the Zagreb indices of \(k\)-trees
Degree sequences of monocore graphs
A note on graphs with prescribed clique and point-partition numbers
Lower bounds for the independence and \(k\)-independence number of graphs using the concept of degenerate degrees
Wiener indices of maximal \(k\)-degenerate graphs
Irregularities of maximal \(k\)-degenerate graphs
Bounds on half graph orders in powers of sparse graphs
A feedback vertex set of 2-degenerate graphs
Hardness of approximate compaction for nonplanar orthogonal graph drawings
An inequality involving the vertex arboricity and edge arboricity of a graph
A bound on the values of independence polynomials at -1/k for k-degenerate graphs
-constructibility of planar graphs
Point Partition Numbers and Girth
Locally identifying colourings for graphs with given maximum degree
-constructibility of planar graphs
Sequences realizable by maximal k‐degenerate graphs
Drawing planar graphs with few geometric primitives
Beyond outerplanarity
Colourings of (k-r,k)-trees
The largest eigenvalue of a graph: A survey
Improved bounds for the chromatic index of graphs and multigraphs
Note on coloring of double disk graphs
Solving maximum clique in sparse graphs: an \({O(nm+n2^{d/4})}\) algorithm for \(d\)-degenerate graphs
Maximum 4-degenerate subgraph of a planar graph
scientific article; zbMATH DE number 1452400 (Why is no real title available?)
The k-conversion number of regular graphs
Vertex partition of hypergraphs and maximum degenerate subhypergraphs
Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs
Proximity Search for Maximal Subgraph Enumeration
Angle covers: algorithms and complexity
Efficient enumeration of dominating sets for sparse graphs
An Updated Experimental Evaluation of Graph Bipartization Methods
On edge product cordial graphs
An output sensitive algorithm for maximal clique enumeration in sparse graphs
Constraint and satisfiability reasoning for graph coloring
Why is maximum clique often easy in practice?
On the support of extremal martingale measures with given marginals: the countable case
Vertex partitions and maximum degenerate subgraphs
Ergodicity of the Wang–Swendsen–Kotecký algorithm on several classes of lattices on the torus
On mixed Ramsey numbers
Incremental optimization of independent sets under the reconfiguration framework
Extremal decompositions for Nordhaus-Gaddum theorems
Partitions of hypergraphs under variable degeneracy constraints
The space complexity of sum labelling
ON THE DIMENSIONS OF THE REALIZATION SPACES OF POLYTOPES
Central Limit Theorem for Linear Eigenvalue Statistics of <scp>Non‐Hermitian</scp> Random Matrices
Generalized DP-colorings of graphs
Extremal problems for connected set enumeration
scientific article; zbMATH DE number 7692355 (Why is no real title available?)
The high order spectrum of a graph and its applications in graph colouring and clique counting
Close-knit neighborhoods: stability of cooperation in networks
Finding small complete subgraphs efficiently
Zagreb indices of maximal \(k\)-degenerate graphs
On the Colin de Verdière graph number and penny graphs
Cyclic base ordering of certain degenerate graphs
Pushing cops and robber on graphs of maximum degree four
The weak version of the graph complement conjecture and partial results for the delta conjecture
The planar Turán number of \({\left \{ C_6, C_7 \right \}}\)
A note on low-communication secure multiparty computation via circuit depth-reduction

This page was built for publication: k-Degenerate Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5599569)