Parity versions of 2-connectedness.
Little, C., Vince, A. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Little, C., Vince, A. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Liebers, Annegret (2001)
Journal of Graph Algorithms and Applications
Similarity:
André Bouchet (1999)
Annales de l'institut Fourier
Similarity:
The following result is proved: if a bipartite graph is not a circle graph, then its complement is not a circle graph. The proof uses Naji’s characterization of circle graphs by means of a linear system of equations with unknowns in . At the end of this short note I briefly recall the work of François Jaeger on circle graphs.
Bohdan Zelinka (1987)
Časopis pro pěstování matematiky
Similarity:
Çevik, A.Sinan, Cangül, İ.Naci (2009)
General Mathematics
Similarity:
Daniel C. Slilaty, Thomas Zaslavsky (2015)
Discussiones Mathematicae Graph Theory
Similarity:
The line graph of a graph with signed edges carries vertex signs. A vertex-signed graph is consistent if every circle (cycle, circuit) has positive vertex-sign product. Acharya, Acharya, and Sinha recently characterized line-consistent signed graphs, i.e., edge-signed graphs whose line graphs, with the naturally induced vertex signature, are consistent. Their proof applies Hoede’s relatively difficult characterization of consistent vertex-signed graphs. We give a simple proof that does...
Cheston, Grant A., Jap, Tjoen Seng (2006)
Journal of Graph Algorithms and Applications
Similarity: