Disjoint triangles and quadrilaterals in a graph

Hong Wang

Displaying similar documents to “Disjoint triangles and quadrilaterals in a graph”

Degree powers in graphs with a forbidden even cycle.

Nikiforov, Vladimir (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Independence number and disjoint theta graphs.

Fujita, Shinya, Magnant, Colton (2011)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Diameter in path graphs.

Belan, A., Jurica, P. (1999)

Acta Mathematica Universitatis Comenianae. New Series

Similarity:

Heavy subgraph pairs for traceability of block-chains

Binlong Li, Hajo Broersma, Shenggui Zhang (2014)

Discussiones Mathematicae Graph Theory

Similarity:

A graph is called traceable if it contains a Hamilton path, i.e., a path containing all its vertices. Let G be a graph on n vertices. We say that an induced subgraph of G is o−1-heavy if it contains two nonadjacent vertices which satisfy an Ore-type degree condition for traceability, i.e., with degree sum at least n−1 in G. A block-chain is a graph whose block graph is a path, i.e., it is either a P1, P2, or a 2-connected graph, or a graph with at least one cut vertex and exactly two...

On a conjecture concerning the Petersen graph.

Nelson, Donald, Plummer, Michael D., Robertson, Neil, Zha, Xiaoya (2011)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

A note on the distance-balanced property of generalized Petersen graphs.

Yang, Rui, Hou, Xinmin, Li, Ning, Zhong, Wei (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Hamiltonicity of $k$ -traceable graphs.

Bullock, Frank, Dankelmann, Peter, Frick, Marietjie, Henning, Michael A., Oellermann, Ortrud R., van Aardt, Susan (2011)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

On the graphs with maximum distance or $k$ -diameter

Wayne Goddard, Christine S. Swart, Henda C. Swart (2005)

Mathematica Slovaca

Similarity: