Remark on a paper of Lovász
Václav Chvátal (1968)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Displaying similar documents to “Bipartite intersection graphs”
Remark on a paper of Lovász
Partitions of vertices
Jaroslav Nešetřil, Vojtěch Rödl (1976)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Graph equations, graph inequalities and a fixed point theorem.
I.B. Lackovic, D.M. Cvetkovic (1976)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity:
Geodetic line, middle and total graphs
Jerzy Topp (1990)
Mathematica Slovaca
Similarity:
A note on the graph equation .
Simić, Slobodan K. (1988)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Note on enumeration of labeled split graphs
Vladislav Bína, Jiří Přibil (2015)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
The paper brings explicit formula for enumeration of vertex-labeled split graphs with given number of vertices. The authors derive this formula combinatorially using an auxiliary assertion concerning number of split graphs with given clique number. In conclusion authors discuss enumeration of vertex-labeled bipartite graphs, i.e., a graphical class defined in a similar manner to the class of split graphs.
The Existence Of P≥3-Factor Covered Graphs
Sizhong Zhou, Jiancheng Wu, Tao Zhang (2017)
Discussiones Mathematicae Graph Theory
Similarity:
A spanning subgraph F of a graph G is called a P≥3-factor of G if every component of F is a path of order at least 3. A graph G is called a P≥3-factor covered graph if G has a P≥3-factor including e for any e ∈ E(G). In this paper, we obtain three sufficient conditions for graphs to be P≥3-factor covered graphs. Furthermore, it is shown that the results are sharp.