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