Degree constrained subgraphs

DOI10.1016/j.dam.2007.05.059zbMath1147.05055OpenAlexW2124994312MaRDI QIDQ2482112

Louigi Addario-Berry, Ketan Dalal, Bruce A. Reed

Publication date: 16 April 2008

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2007.05.059

zbMATH Keywords

vertex colouring edge weighting degree constrained subgraphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Related Items (61)

A note on adjacent vertex distinguishing colorings of graphs ⋮ Group sum chromatic number of graphs ⋮ Total edge irregularity strength of generalized prism ⋮ On decomposing graphs of large minimum degree into locally irregular subgraphs ⋮ A note on the weak \((2,2)\)-conjecture ⋮ Vertex-coloring 3-edge-weighting of some graphs ⋮ Weak and strong versions of the 1-2-3 conjecture for uniform hypergraphs ⋮ A relaxed case on 1-2-3 conjecture ⋮ Neighbor sum distinguishing index of \(K_4\)-minor free graphs ⋮ A note on 1-2-3 conjecture for Halin graphs ⋮ Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree ⋮ The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture ⋮ Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited ⋮ The edge-labeling and vertex-colors of \(K_n\) ⋮ Every nice graph is (1,5)-choosable ⋮ On the standard \((2,2)\)-conjecture ⋮ Neighbour-distinguishing labellings of powers of paths and powers of cycles ⋮ Vertex-coloring 2-edge-weighting of graphs ⋮ Distant irregularity strength of graphs with bounded minimum degree ⋮ Algorithmic complexity of proper labeling problems ⋮ Distant irregularity strength of graphs ⋮ Total Weight Choosability of Trees ⋮ Colourings of graphs by labellings ⋮ Colour-blind can distinguish colour pallets ⋮ Antifactors of regular bipartite graphs ⋮ Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees ⋮ On the total versions of 1-2-3-conjecture for graphs and hypergraphs ⋮ Computation of lucky number of planar graphs is NP-hard ⋮ On the neighbour sum distinguishing index of graphs with bounded maximum average degree ⋮ A solution to the 1-2-3 conjecture ⋮ On offset Hamilton cycles in random hypergraphs ⋮ On the approximability of some degree-constrained subgraph problems ⋮ A note on asymptotically optimal neighbour sum distinguishing colourings ⋮ On approximating the \(d\)-girth of a graph ⋮ The complexity of the proper orientation number ⋮ A note on face coloring entire weightings of plane graphs ⋮ The 1-2-3 conjecture almost holds for regular graphs ⋮ The \(1,2,3\)-conjecture and \(1,2\)-conjecture for sparse graphs ⋮ A note on vertex colorings of plane graphs ⋮ From the 1-2-3 conjecture to the Riemann hypothesis ⋮ NEIGHBOR SUM DISTINGUISHING COLORING OF SOME GRAPHS ⋮ Total weight choosability of Mycielski graphs ⋮ On weight choosabilities of graphs with bounded maximum average degree ⋮ Vertex-coloring edge-weightings: towards the 1-2-3-conjecture ⋮ Linear bounds on nowhere-zero group irregularity strength and nowhere-zero group sum chromatic number of graphs ⋮ Distant sum distinguishing index of graphs ⋮ Decomposability of graphs into subgraphs fulfilling the 1-2-3 conjecture ⋮ Degree-Constrained Subgraph Problems: Hardness and Approximation Results ⋮ Lucky labelings of graphs ⋮ Equitable neighbour-sum-distinguishing edge and total colourings ⋮ Weight choosability of graphs ⋮ Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz ⋮ On vertex-coloring 13-edge-weighting ⋮ On Approximating the d-Girth of a Graph ⋮ Distant sum distinguishing index of graphs with bounded minimum degree ⋮ On the Neighbor Sum Distinguishing Index of Planar Graphs ⋮ Coloring chip configurations on graphs and digraphs ⋮ Edge irregular total labellings for graphs of linear size ⋮ Factors of bi-regular bipartite graphs ⋮ 3-Regular subgraphs and (3,1)-colorings of 4-regular pseudographs ⋮ On decomposing regular graphs into locally irregular subgraphs

Cites Work

This page was built for publication: Degree constrained subgraphs