Disjoint Triangles of a Cubic Line Graph

@article{Zhang2004DisjointTO,
  title={Disjoint Triangles of a Cubic Line Graph},
  author={Xiaodong Zhang and Stanislaw Bylka},
  journal={Graphs and Combinatorics},
  year={2004},
  volume={20},
  pages={275-280}
}
Abstract.In this paper, we prove that a cubic line graph G on n vertices rather than the complete graph K4 has vertex-disjoint triangles and the vertex independence number . Moreover, the equitable chromatic number, acyclic chromatic number and bipartite density of G are respectively. 

Planarization and Acyclic Colorings of Subcubic Claw-Free Graphs

TLDR
The largest known subclass of subcubic graphs such that an optimal acyclic vertex coloring can be found in polynomial-time is presented, and it is shown that this bound is tight by proving that the problem is NP-hard for cubic line graphs (and therefore, claw-free graphs) of maximum degree d≥4.

A Complexity Picture for H-Free Graphs

18 A k-colouring c of a graph G is a mapping V (G)→ {1, 2, . . . k} such that c(u) 6= c(v) whenever u 19 and v are adjacent. The corresponding decision problem is Colouring. A colouring is acyclic,

Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs

TLDR
This study gives almost complete classifications for the computational complexity of Acyclic Colouring, Star Colouring and Injective Colouring for H-free graphs and concludes that for fixed k the three problems behave in the same way, but this is no longer true if k is part of the input.

Counting Edge-injective Homomorphisms and Matchings on Restricted Graph Classes

TLDR
It is shown that edge-injective homomorphisms from a pattern graph £H$ can be counted in polynomial time if $H$ has bounded vertex-cover number after removing isolated edges and if the graphs in $\mathcal{H}$ have unbounded vertex- cover number even after deleting isolated edges.

References

SHOWING 1-10 OF 15 REFERENCES

Extremal bipartite subgraphs of cubic triangle-free graphs

TLDR
A cubic triangle-free graph has a bipartite subgraph with at least 4/5 of the original edges with a best possible result.

A new proof of the independence ratio of triangle-free cubic graphs

Graph Coloring Problems

Planar Graphs. Graphs on Higher Surfaces. Degrees. Critical Graphs. The Conjectures of Hadwiger and Hajos. Sparse Graphs. Perfect Graphs. Geometric and Combinatorial Graphs. Algorithms.

Characterizations of derived graphs

A note on cycles in 2-factors of line graphs

We provide a generalization to the well-known result of Harary and Nash-Williams characterizing graphs with Hamiltonian line graphs. Our generalization allows us to characterize those graphs whose

Graph partition problems into cycles and paths

The size of the largest bipartite subgraphs

Nonhamiltonian 3-Connected Cubic Planar Graphs

TLDR
It is established that every cyclically 4-connected cubic planar graph of order at most 40 is hamiltonian and this bound is determined to be sharp, and all nonhamiltonian examples of order 42 are presented.

Largest bipartite subgraphs in triangle-free graphs with maximum degree three

On presente un algorithme polynomial permettant de determiner un sous-graphe biparti d'un graphe G sans triangle ni boucle de degre maximum 3, contenant au moins 4/5 des aretes de G. On caracterise

On the maximum number of independent cycles in a graph