论文信息 - Degree constrained subgraphs

Degree constrained subgraphs

In this paper, we present new structural results about the existence of a subgraph where the degrees of the vertices are pre-specified. Further, we use these results to prove a 16-edge-weighting version of a conjecture by Karonski, Luczak and Thomason, an asymptotic 2-edge-weighting version of the same conjecture, and a 78 version of Louigi's Conjecture.

[1] Keith Edwards,et al. The Harmonious Chromatic Number of Bounded Degree Graphs , 1997 .

[2] A. Thomason,et al. Edge weights and vertex colours , 2004 .

[3] P. Balister,et al. Vertex-distinguishing edge colorings of graphs , 2003 .

[4] Roman Soták,et al. Vertex-distinguishing proper edge colourings of some regular graphs , 2008, Discret. Math..

[5] András Sebö,et al. General Antifactors of Graphs , 1993, J. Comb. Theory, Ser. B.

[6] Bruce A. Reed,et al. Vertex-Colouring Edge-Weightings , 2007, Comb..

[7] Bruce A. Reed,et al. Vertex colouring edge partitions , 2005, J. Comb. Theory B.

[8] L. Lovász. The factorization of graphs. II , 1972 .

[9] Reinhard Diestel,et al. Graph Theory , 1997 .

[10] Zsolt Tuza,et al. Irregular assignments and vertex-distinguishing edge-colorings of graphs , 1990 .

[11] R. Schelp,et al. Vertex-distinguishing proper edge-colorings , 1997 .

[12] Alexander Schrijver,et al. Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[13] David G. Kirkpatrick,et al. A simple existence criterion for (g , 1990, Discret. Math..