k-Degenerate Graphs - MaRDI portal

DOI10.4153/CJM-1970-125-1zbMATH Open0202.23502WikidataQ56235006 ScholiaQ56235006MaRDI QIDQ5599569FDOQ5599569

Authors: Don R. Lick, Arthur T. White

Publication date: 1970

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

Cited In (only showing first 100 items - show all)

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

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)